diff --git a/src/components/Acknowledgements/styles.scss b/src/components/Acknowledgements/styles.scss
index 92e38243..3602f44c 100644
--- a/src/components/Acknowledgements/styles.scss
+++ b/src/components/Acknowledgements/styles.scss
@@ -13,3 +13,13 @@
     padding: 0;
   }
 }
+
+body.dark-mode .acknowledgements {
+  background-color: #161a1d;
+  color: #ffffff;
+
+  .card {
+    background-color: #1d2125;
+    color: #ffffff;
+  }
+}
diff --git a/src/components/Dark-Mode/index.js b/src/components/Dark-Mode/index.js
new file mode 100644
index 00000000..7d7690a0
--- /dev/null
+++ b/src/components/Dark-Mode/index.js
@@ -0,0 +1,31 @@
+import React, { useState, useEffect } from 'react';
+import Toggle from 'react-toggle';
+
+const DarkMode = () => {
+  const [darkMode, setDarkMode] = useState(() => {
+    const savedMode = localStorage.getItem('darkMode');
+    return savedMode ? JSON.parse(savedMode) : false;
+  });
+
+  const toggleDarkMode = () => {
+    setDarkMode(prevMode => {
+      const newMode = !prevMode;
+      localStorage.setItem('darkMode', newMode);
+      return newMode;
+    });
+  };
+  useEffect(() => {
+    document.body.className = darkMode ? 'dark-mode' : 'light-mode';
+  }, [darkMode]);
+
+  return (
+    <Toggle
+      id="darkMode-toggle"
+      checked={darkMode}
+      onChange={toggleDarkMode}
+      icons={{ checked: '🌙', unchecked: '☀️' }}
+    />
+  );
+};
+
+export default DarkMode;
diff --git a/src/components/Navigation/index.js b/src/components/Navigation/index.js
index b23fbf14..39d370d7 100644
--- a/src/components/Navigation/index.js
+++ b/src/components/Navigation/index.js
@@ -11,10 +11,11 @@ import { FaGithub } from 'react-icons/fa';
 import { Event } from '../Shared/Tracking';
 
 import './styles.scss';
+import DarkMode from '../Dark-Mode';
 
 const Navigation = () => {
   return (
-    <Navbar color="light" light>
+    <Navbar className="navbar">
       <Container>
         <NavbarBrand
           onClick={() =>
@@ -34,6 +35,7 @@ const Navigation = () => {
             </NavLink>
           </NavItem>
         </Nav>
+        <DarkMode />
       </Container>
     </Navbar>
   );
diff --git a/src/components/Navigation/styles.scss b/src/components/Navigation/styles.scss
index dce9bfad..111f17aa 100644
--- a/src/components/Navigation/styles.scss
+++ b/src/components/Navigation/styles.scss
@@ -1,3 +1,25 @@
+body.light-mode .navbar {
+  background-color: #f7f8f9;
+  color: #000000;
+}
+body.light-mode .navbar a {
+  color: #212529;
+}
+
+body.dark-mode .navbar {
+  background-color: #1d2125;
+  color: #ffffff;
+}
+body.dark-mode .navbar a {
+  color: #ffffff;
+}
+body.dark-mode .navbar-nav svg {
+  color: #ffffff;
+}
+body.dark-mode .navbar-nav svg:hover {
+  color: #ffc952;
+}
+
 .navbar-brand {
   font-weight: 600;
   letter-spacing: 1px;
@@ -29,5 +51,6 @@
 
   svg {
     font-size: 2em;
+    margin: 0px 10px;
   }
 }
diff --git a/src/components/Table/index.js b/src/components/Table/index.js
index 68b42123..39125efa 100644
--- a/src/components/Table/index.js
+++ b/src/components/Table/index.js
@@ -176,7 +176,7 @@ const Table = () => {
                     labelPosition={0}
                     labelStyle={{
                       // Needed for Dark Reader to work
-                      fill: 'black',
+                      fill: '#A54800',
                     }}
                     startAngle={-90}
                     lineWidth={12}
diff --git a/src/components/Table/styles.scss b/src/components/Table/styles.scss
index 990d7d22..988e8e9f 100644
--- a/src/components/Table/styles.scss
+++ b/src/components/Table/styles.scss
@@ -1,3 +1,54 @@
+body.light-mode .table {
+  background-color: #ffffff;
+  color: #000000;
+}
+body.light-mode .table thead > tr th {
+  background-color: #ffffff;
+}
+body.light-mode .pattern-count {
+  background-color: #ffffff;
+  color: #000000;
+}
+body.light-mode .table tr:nth-child(odd) {
+  background-color: #f1f2f4;
+}
+body.light-mode .table tr:nth-child(even) {
+  background-color: #ffffff;
+}
+body.light-mode .table tbody tr:hover {
+  background-color: #dcdfe4;
+  color: #000000;
+}
+
+body.dark-mode .table {
+  background-color: #161a1d;
+  color: #ffffff;
+}
+body.dark-mode .table thead > tr th {
+  background-color: #161a1d;
+}
+body.dark-mode .pattern-count {
+  background-color: #161a1d;
+  color: #ffffff;
+}
+body.dark-mode .table tr:nth-child(odd) {
+  background-color: #22272b;
+}
+body.dark-mode .table tr:nth-child(even) {
+  background-color: #161a1d;
+}
+body.dark-mode .table tbody tr:hover {
+  background-color: #101214;
+  color: #ffffff;
+}
+body.dark-mode .modal-content {
+  background-color: #1d2125;
+  color: #ffffff;
+  .close {
+    color: #ffffff;
+  }
+}
+
 .table {
   .row {
     justify-content: center;
diff --git a/src/components/Tips/styles.scss b/src/components/Tips/styles.scss
index a96bf7fa..84ef3d7e 100644
--- a/src/components/Tips/styles.scss
+++ b/src/components/Tips/styles.scss
@@ -7,3 +7,17 @@
   color: #333;
   background: #f8f8f8;
 }
+body.light-mode .tips {
+  background-color: #f7f8f9;
+  color: #333;
+}
+
+body.dark-mode .tips {
+  background-color: #1d2125;
+  color: #ffffff;
+}
+body.dark-mode .tips pre,
+body.dark-mode .tips code {
+  background-color: #1d2125;
+  color: #ffffff;
+}
diff --git a/src/components/styles.scss b/src/components/styles.scss
index eb814e6a..47faf352 100644
--- a/src/components/styles.scss
+++ b/src/components/styles.scss
@@ -1,10 +1,24 @@
 @import url('https://fonts.googleapis.com/css?family=Open+Sans:400,700');
 
 .App {
-  margin-left: calc(100vw - 100%);
   margin-right: 0;
-
   font-family: 'Open Sans', sans-serif;
   font-size: 14px;
   -webkit-font-smoothing: antialiased !important;
 }
+
+body.light-mode {
+  background-color: #ffffff;
+  color: #000000;
+}
+body.light-mode a {
+  color: #0c66e4;
+}
+
+body.dark-mode {
+  background-color: #161a1d;
+  color: #ffffff;
+}
+body.dark-mode a {
+  color: #579dff;
+}
diff --git a/src/data/questions.json b/src/data/questions.json
index 50704826..c2fc6408 100644
--- a/src/data/questions.json
+++ b/src/data/questions.json
@@ -5,9 +5,7 @@
       "id": 0,
       "title": "Contains Duplicate",
       "slug": "contains-duplicate",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -62,10 +60,7 @@
       "id": 1,
       "title": "Missing Number",
       "slug": "missing-number",
-      "pattern": [
-        "Arrays",
-        "Bit Manipulation"
-      ],
+      "pattern": ["Arrays", "Bit Manipulation"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -125,9 +120,7 @@
       "id": 2,
       "title": "Find All Numbers Disappeared in an Array",
       "slug": "find-all-numbers-disappeared-in-an-array",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -147,10 +140,7 @@
       "id": 3,
       "title": "Single Number",
       "slug": "single-number",
-      "pattern": [
-        "Arrays",
-        "Bit Manipulation"
-      ],
+      "pattern": ["Arrays", "Bit Manipulation"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -195,9 +185,7 @@
       "id": 4,
       "title": "Product of Array Except Self",
       "slug": "product-of-array-except-self",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -307,11 +295,7 @@
       "id": 5,
       "title": "Find the Duplicate Number",
       "slug": "find-the-duplicate-number",
-      "pattern": [
-        "Arrays",
-        "Binary Search",
-        "Two Pointers"
-      ],
+      "pattern": ["Arrays", "Binary Search", "Two Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -376,9 +360,7 @@
       "id": 6,
       "title": "Find All Duplicates in an Array",
       "slug": "find-all-duplicates-in-an-array",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -408,9 +390,7 @@
       "id": 7,
       "title": "Set Matrix Zeroes",
       "slug": "set-matrix-zeroes",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -465,9 +445,7 @@
       "id": 8,
       "title": "Spiral Matrix",
       "slug": "spiral-matrix",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -552,9 +530,7 @@
       "id": 9,
       "title": "Rotate Image",
       "slug": "rotate-image",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -654,9 +630,7 @@
       "id": 10,
       "title": "Word Search",
       "slug": "word-search",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -746,9 +720,7 @@
       "id": 11,
       "title": "First Missing Positive",
       "slug": "first-missing-positive",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -828,9 +800,7 @@
       "id": 12,
       "title": "Longest Consecutive Sequence",
       "slug": "longest-consecutive-sequence",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -915,9 +885,7 @@
       "id": 13,
       "title": "Letter Case Permutation",
       "slug": "letter-case-permutation",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": []
@@ -926,9 +894,7 @@
       "id": 14,
       "title": "Subsets",
       "slug": "subsets",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -998,9 +964,7 @@
       "id": 15,
       "title": "Subsets II",
       "slug": "subsets-ii",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1055,9 +1019,7 @@
       "id": 16,
       "title": "Permutations",
       "slug": "permutations",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1122,9 +1084,7 @@
       "id": 17,
       "title": "Permutations II",
       "slug": "permutations-ii",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1154,9 +1114,7 @@
       "id": 18,
       "title": "Combinations",
       "slug": "combinations",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1191,9 +1149,7 @@
       "id": 19,
       "title": "Combination Sum",
       "slug": "combination-sum",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1278,9 +1234,7 @@
       "id": 20,
       "title": "Combination Sum II",
       "slug": "combination-sum-ii",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1330,9 +1284,7 @@
       "id": 21,
       "title": "Combination Sum III",
       "slug": "combination-sum-iii",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1347,9 +1299,7 @@
       "id": 22,
       "title": "Generate Parentheses",
       "slug": "generate-parentheses",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1459,11 +1409,7 @@
       "id": 23,
       "title": "Target Sum",
       "slug": "target-sum",
-      "pattern": [
-        "Backtracking",
-        "DFS",
-        "Dynamic Programming"
-      ],
+      "pattern": ["Backtracking", "DFS", "Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1508,9 +1454,7 @@
       "id": 24,
       "title": "Palindrome Partitioning",
       "slug": "palindrome-partitioning",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1555,9 +1499,7 @@
       "id": 25,
       "title": "Letter Combinations of a Phone Number",
       "slug": "letter-combinations-of-a-phone-number",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -1647,9 +1589,7 @@
       "id": 26,
       "title": "Generalized Abbreviation",
       "slug": "generalized-abbreviation",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": true,
       "companies": []
@@ -1658,9 +1598,7 @@
       "id": 27,
       "title": "Sudoku Solver",
       "slug": "sudoku-solver",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -1720,9 +1658,7 @@
       "id": 28,
       "title": "N-Queens",
       "slug": "n-queens",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -1772,9 +1708,7 @@
       "id": 29,
       "title": "Climbing Stairs",
       "slug": "climbing-stairs",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -1884,9 +1818,7 @@
       "id": 30,
       "title": "House Robber",
       "slug": "house-robber",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2031,9 +1963,7 @@
       "id": 31,
       "title": "Best Time to Buy and Sell Stock",
       "slug": "best-time-to-buy-and-sell-stock",
-      "pattern": [
-        "Greedy"
-      ],
+      "pattern": ["Greedy"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -2238,9 +2168,7 @@
       "id": 32,
       "title": "Maximum Subarray",
       "slug": "maximum-subarray",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2355,9 +2283,7 @@
       "id": 33,
       "title": "Range Sum Query - Immutable",
       "slug": "range-sum-query-immutable",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -2387,9 +2313,7 @@
       "id": 34,
       "title": "House Robber II",
       "slug": "house-robber-ii",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2459,9 +2383,7 @@
       "id": 35,
       "title": "Coin Change",
       "slug": "coin-change",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2531,9 +2453,7 @@
       "id": 36,
       "title": "Maximum Product Subarray",
       "slug": "maximum-product-subarray",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2623,9 +2543,7 @@
       "id": 37,
       "title": "Longest Increasing Subsequence",
       "slug": "longest-increasing-subsequence",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2705,9 +2623,7 @@
       "id": 38,
       "title": "Longest Palindromic Substring",
       "slug": "longest-palindromic-substring",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2867,9 +2783,7 @@
       "id": 39,
       "title": "Word Break",
       "slug": "word-break",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2954,9 +2868,7 @@
       "id": 40,
       "title": "Combination Sum IV",
       "slug": "combination-sum-iv",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -2971,9 +2883,7 @@
       "id": 41,
       "title": "Decode Ways",
       "slug": "decode-ways",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3038,9 +2948,7 @@
       "id": 42,
       "title": "Unique Paths",
       "slug": "unique-paths",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3100,10 +3008,7 @@
       "id": 43,
       "title": "Jump Game",
       "slug": "jump-game",
-      "pattern": [
-        "Dynamic Programming",
-        "Greedy"
-      ],
+      "pattern": ["Dynamic Programming", "Greedy"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3198,9 +3103,7 @@
       "id": 44,
       "title": "Palindromic Substrings",
       "slug": "palindromic-substrings",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3255,9 +3158,7 @@
       "id": 45,
       "title": "Number of Longest Increasing Subsequence",
       "slug": "number-of-longest-increasing-subsequence",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3272,9 +3173,7 @@
       "id": 46,
       "title": "Partition Equal Subset Sum",
       "slug": "partition-equal-subset-sum",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3319,9 +3218,7 @@
       "id": 47,
       "title": "Partition to K Equal Sum Subsets",
       "slug": "partition-to-k-equal-sum-subsets",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3346,9 +3243,7 @@
       "id": 48,
       "title": "Best Time to Buy and Sell Stock with Cooldown",
       "slug": "best-time-to-buy-and-sell-stock-with-cooldown",
-      "pattern": [
-        "Dynamic Programming"
-      ],
+      "pattern": ["Dynamic Programming"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3368,10 +3263,7 @@
       "id": 49,
       "title": "Counting Bits",
       "slug": "counting-bits",
-      "pattern": [
-        "Dynamic Programming",
-        "Bit Manipulation"
-      ],
+      "pattern": ["Dynamic Programming", "Bit Manipulation"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -3406,9 +3298,7 @@
       "id": 50,
       "title": "Linked List Cycle",
       "slug": "linked-list-cycle",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -3453,9 +3343,7 @@
       "id": 51,
       "title": "Middle of the Linked List",
       "slug": "middle-of-the-linked-list",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -3510,9 +3398,7 @@
       "id": 52,
       "title": "Reverse Linked List",
       "slug": "reverse-linked-list",
-      "pattern": [
-        "In-place reversal of a linked list"
-      ],
+      "pattern": ["In-place reversal of a linked list"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -3577,9 +3463,7 @@
       "id": 53,
       "title": "Palindrome Linked List",
       "slug": "palindrome-linked-list",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -3634,9 +3518,7 @@
       "id": 54,
       "title": "Remove Linked List Elements",
       "slug": "remove-linked-list-elements",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -3661,9 +3543,7 @@
       "id": 55,
       "title": "Remove Duplicates from Sorted List",
       "slug": "remove-duplicates-from-sorted-list",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -3698,9 +3578,7 @@
       "id": 56,
       "title": "Linked List Cycle II",
       "slug": "linked-list-cycle-ii",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3735,9 +3613,7 @@
       "id": 57,
       "title": "Add Two Numbers",
       "slug": "add-two-numbers",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3837,9 +3713,7 @@
       "id": 58,
       "title": "Remove Nth Node From End of List",
       "slug": "remove-nth-node-from-end-of-list",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3899,9 +3773,7 @@
       "id": 59,
       "title": "Sort List",
       "slug": "sort-list",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3941,9 +3813,7 @@
       "id": 60,
       "title": "Reorder List",
       "slug": "reorder-list",
-      "pattern": [
-        "Fast & Slow Pointers"
-      ],
+      "pattern": ["Fast & Slow Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -3993,10 +3863,7 @@
       "id": 61,
       "title": "Pacific Atlantic Water Flow",
       "slug": "pacific-atlantic-water-flow",
-      "pattern": [
-        "BFS",
-        "DFS"
-      ],
+      "pattern": ["BFS", "DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -4036,11 +3903,7 @@
       "id": 62,
       "title": "Number of Islands",
       "slug": "number-of-islands",
-      "pattern": [
-        "BFS",
-        "DFS",
-        "Union Find"
-      ],
+      "pattern": ["BFS", "DFS", "Union Find"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -4235,12 +4098,7 @@
       "id": 63,
       "title": "Graph Valid Tree",
       "slug": "graph-valid-tree",
-      "pattern": [
-        "BFS",
-        "DFS",
-        "Graph",
-        "Union Find"
-      ],
+      "pattern": ["BFS", "DFS", "Graph", "Union Find"],
       "difficulty": "Medium",
       "premium": true,
       "companies": [
@@ -4280,12 +4138,7 @@
       "id": 64,
       "title": "Number of Connected Components in an Undirected Graph",
       "slug": "number-of-connected-components-in-an-undirected-graph",
-      "pattern": [
-        "BFS",
-        "DFS",
-        "Graph",
-        "Union Find"
-      ],
+      "pattern": ["BFS", "DFS", "Graph", "Union Find"],
       "difficulty": "Medium",
       "premium": true,
       "companies": [
@@ -4315,9 +4168,7 @@
       "id": 65,
       "title": "Reverse Linked List II",
       "slug": "reverse-linked-list-ii",
-      "pattern": [
-        "In-place reversal of a linked list"
-      ],
+      "pattern": ["In-place reversal of a linked list"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -4377,9 +4228,7 @@
       "id": 66,
       "title": "Rotate List",
       "slug": "rotate-list",
-      "pattern": [
-        "In-place reversal of a linked list"
-      ],
+      "pattern": ["In-place reversal of a linked list"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -4429,9 +4278,7 @@
       "id": 67,
       "title": "Swap Nodes in Pairs",
       "slug": "swap-nodes-in-pairs",
-      "pattern": [
-        "In-place reversal of a linked list"
-      ],
+      "pattern": ["In-place reversal of a linked list"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -4486,9 +4333,7 @@
       "id": 68,
       "title": "Odd Even Linked List",
       "slug": "odd-even-linked-list",
-      "pattern": [
-        "In-place reversal of a linked list"
-      ],
+      "pattern": ["In-place reversal of a linked list"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -4528,9 +4373,7 @@
       "id": 69,
       "title": "Reverse Nodes in k-Group",
       "slug": "reverse-nodes-in-k-group",
-      "pattern": [
-        "In-place reversal of a linked list"
-      ],
+      "pattern": ["In-place reversal of a linked list"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -4605,9 +4448,7 @@
       "id": 70,
       "title": "Merge Two Sorted Lists",
       "slug": "merge-two-sorted-lists",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -4712,10 +4553,7 @@
       "id": 71,
       "title": "Kth Smallest Element in a Sorted Matrix",
       "slug": "kth-smallest-element-in-a-sorted-matrix",
-      "pattern": [
-        "Binary Search",
-        "Heap"
-      ],
+      "pattern": ["Binary Search", "Heap"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -4755,9 +4593,7 @@
       "id": 72,
       "title": "Find K Pairs with Smallest Sums",
       "slug": "find-k-pairs-with-smallest-sums",
-      "pattern": [
-        "Heap"
-      ],
+      "pattern": ["Heap"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -4777,9 +4613,7 @@
       "id": 73,
       "title": "Merge k Sorted Lists",
       "slug": "merge-k-sorted-lists",
-      "pattern": [
-        "Heap"
-      ],
+      "pattern": ["Heap"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -4859,9 +4693,7 @@
       "id": 74,
       "title": "Smallest Range Covering Elements from K Lists",
       "slug": "smallest-range-covering-elements-from-k-lists",
-      "pattern": [
-        "Heap"
-      ],
+      "pattern": ["Heap"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -4886,9 +4718,7 @@
       "id": 75,
       "title": "Meeting Rooms",
       "slug": "meeting-rooms",
-      "pattern": [
-        "Intervals"
-      ],
+      "pattern": ["Intervals"],
       "difficulty": "Easy",
       "premium": true,
       "companies": [
@@ -4923,9 +4753,7 @@
       "id": 76,
       "title": "Merge Intervals",
       "slug": "merge-intervals",
-      "pattern": [
-        "Intervals"
-      ],
+      "pattern": ["Intervals"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5135,9 +4963,7 @@
       "id": 77,
       "title": "Interval List Intersections",
       "slug": "interval-list-intersections",
-      "pattern": [
-        "Intervals"
-      ],
+      "pattern": ["Intervals"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5172,9 +4998,7 @@
       "id": 78,
       "title": "Non-overlapping Intervals",
       "slug": "non-overlapping-intervals",
-      "pattern": [
-        "Intervals"
-      ],
+      "pattern": ["Intervals"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5219,10 +5043,7 @@
       "id": 79,
       "title": "Meeting Rooms II",
       "slug": "meeting-rooms-ii",
-      "pattern": [
-        "Heap",
-        "Intervals"
-      ],
+      "pattern": ["Heap", "Intervals"],
       "difficulty": "Medium",
       "premium": true,
       "companies": [
@@ -5332,10 +5153,7 @@
       "id": 80,
       "title": "Task Scheduler",
       "slug": "task-scheduler",
-      "pattern": [
-        "Greedy",
-        "Heap"
-      ],
+      "pattern": ["Greedy", "Heap"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5410,9 +5228,7 @@
       "id": 81,
       "title": "Minimum Number of Arrows to Burst Balloons",
       "slug": "minimum-number-of-arrows-to-burst-balloons",
-      "pattern": [
-        "Greedy"
-      ],
+      "pattern": ["Greedy"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5437,9 +5253,7 @@
       "id": 82,
       "title": "Insert Interval",
       "slug": "insert-interval",
-      "pattern": [
-        "Intervals"
-      ],
+      "pattern": ["Intervals"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5509,10 +5323,7 @@
       "id": 83,
       "title": "Employee Free Time",
       "slug": "employee-free-time",
-      "pattern": [
-        "Heap",
-        "Greedy"
-      ],
+      "pattern": ["Heap", "Greedy"],
       "difficulty": "Hard",
       "premium": true,
       "companies": [
@@ -5532,9 +5343,7 @@
       "id": 84,
       "title": "Binary Search",
       "slug": "binary-search",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -5574,9 +5383,7 @@
       "id": 85,
       "title": "Find Smallest Letter Greater Than Target",
       "slug": "find-smallest-letter-greater-than-target",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Easy",
       "premium": false,
       "companies": []
@@ -5585,9 +5392,7 @@
       "id": 86,
       "title": "Peak Index in a Mountain Array",
       "slug": "peak-index-in-a-mountain-array",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5622,9 +5427,7 @@
       "id": 87,
       "title": "Find Minimum in Rotated Sorted Array",
       "slug": "find-minimum-in-rotated-sorted-array",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5684,9 +5487,7 @@
       "id": 88,
       "title": "Find Peak Element",
       "slug": "find-peak-element",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5756,9 +5557,7 @@
       "id": 89,
       "title": "Search in Rotated Sorted Array",
       "slug": "search-in-rotated-sorted-array",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5878,9 +5677,7 @@
       "id": 90,
       "title": "Search in Rotated Sorted Array II",
       "slug": "search-in-rotated-sorted-array-ii",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5905,9 +5702,7 @@
       "id": 91,
       "title": "Search a 2D Matrix",
       "slug": "search-a-2d-matrix",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -5972,9 +5767,7 @@
       "id": 92,
       "title": "Search a 2D Matrix II",
       "slug": "search-a-2d-matrix-ii",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6019,9 +5812,7 @@
       "id": 93,
       "title": "Find K Closest Elements",
       "slug": "find-k-closest-elements",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6091,9 +5882,7 @@
       "id": 94,
       "title": "Count of Range Sum",
       "slug": "count-of-range-sum",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Hard",
       "premium": false,
       "companies": []
@@ -6102,9 +5891,7 @@
       "id": 95,
       "title": "Minimum Size Subarray Sum",
       "slug": "minimum-size-subarray-sum",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6159,9 +5946,7 @@
       "id": 96,
       "title": "Fruit Into Baskets",
       "slug": "fruit-into-baskets",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6201,9 +5986,7 @@
       "id": 97,
       "title": "Permutation in String",
       "slug": "permutation-in-string",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6253,9 +6036,7 @@
       "id": 98,
       "title": "Longest Repeating Character Replacement",
       "slug": "longest-repeating-character-replacement",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6325,9 +6106,7 @@
       "id": 99,
       "title": "Sliding Window Maximum",
       "slug": "sliding-window-maximum",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -6417,9 +6196,7 @@
       "id": 100,
       "title": "Longest Substring Without Repeating Characters",
       "slug": "longest-substring-without-repeating-characters",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6614,9 +6391,7 @@
       "id": 101,
       "title": "Minimum Number of K Consecutive Bit Flips",
       "slug": "minimum-number-of-k-consecutive-bit-flips",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -6641,9 +6416,7 @@
       "id": 102,
       "title": "Count Unique Characters of All Substrings of a Given String",
       "slug": "count-unique-characters-of-all-substrings-of-a-given-string",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -6658,9 +6431,7 @@
       "id": 103,
       "title": "Minimum Window Substring",
       "slug": "minimum-window-substring",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -6750,9 +6521,7 @@
       "id": 104,
       "title": "Substring with Concatenation of All Words",
       "slug": "substring-with-concatenation-of-all-words",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -6782,9 +6551,7 @@
       "id": 105,
       "title": "Kth Smallest Element in a BST",
       "slug": "kth-smallest-element-in-a-bst",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6834,9 +6601,7 @@
       "id": 106,
       "title": "K Closest Points to Origin",
       "slug": "k-closest-points-to-origin",
-      "pattern": [
-        "Heap"
-      ],
+      "pattern": ["Heap"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6871,9 +6636,7 @@
       "id": 107,
       "title": "Top K Frequent Elements",
       "slug": "top-k-frequent-elements",
-      "pattern": [
-        "Heap"
-      ],
+      "pattern": ["Heap"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -6993,9 +6756,7 @@
       "id": 108,
       "title": "Sort Characters By Frequency",
       "slug": "sort-characters-by-frequency",
-      "pattern": [
-        "Heap"
-      ],
+      "pattern": ["Heap"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7060,10 +6821,7 @@
       "id": 109,
       "title": "Kth Largest Element in an Array",
       "slug": "kth-largest-element-in-an-array",
-      "pattern": [
-        "Heap",
-        "QuickSelect"
-      ],
+      "pattern": ["Heap", "QuickSelect"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7163,10 +6921,7 @@
       "id": 110,
       "title": "Reorganize String",
       "slug": "reorganize-string",
-      "pattern": [
-        "Greedy",
-        "Heap"
-      ],
+      "pattern": ["Greedy", "Heap"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7241,10 +6996,7 @@
       "id": 111,
       "title": "Rearrange String k Distance Apart",
       "slug": "rearrange-string-k-distance-apart",
-      "pattern": [
-        "Greedy",
-        "Heap"
-      ],
+      "pattern": ["Greedy", "Heap"],
       "difficulty": "Hard",
       "premium": true,
       "companies": [
@@ -7259,10 +7011,7 @@
       "id": 112,
       "title": "Course Schedule III",
       "slug": "course-schedule-iii",
-      "pattern": [
-        "Greedy",
-        "Heap"
-      ],
+      "pattern": ["Greedy", "Heap"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -7277,10 +7026,7 @@
       "id": 113,
       "title": "Maximum Frequency Stack",
       "slug": "maximum-frequency-stack",
-      "pattern": [
-        "Bucket Sort",
-        "Heap"
-      ],
+      "pattern": ["Bucket Sort", "Heap"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -7310,12 +7056,7 @@
       "id": 114,
       "title": "Course Schedule",
       "slug": "course-schedule",
-      "pattern": [
-        "BFS",
-        "DFS",
-        "Graph",
-        "Topological Sort"
-      ],
+      "pattern": ["BFS", "DFS", "Graph", "Topological Sort"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7415,12 +7156,7 @@
       "id": 115,
       "title": "Course Schedule II",
       "slug": "course-schedule-ii",
-      "pattern": [
-        "BFS",
-        "DFS",
-        "Graph",
-        "Topological Sort"
-      ],
+      "pattern": ["BFS", "DFS", "Graph", "Topological Sort"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7520,11 +7256,7 @@
       "id": 116,
       "title": "Minimum Height Trees",
       "slug": "minimum-height-trees",
-      "pattern": [
-        "BFS",
-        "Graph",
-        "Topological Sort"
-      ],
+      "pattern": ["BFS", "Graph", "Topological Sort"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7559,10 +7291,7 @@
       "id": 117,
       "title": "Alien Dictionary",
       "slug": "alien-dictionary",
-      "pattern": [
-        "Graph",
-        "Topological Sort"
-      ],
+      "pattern": ["Graph", "Topological Sort"],
       "difficulty": "Hard",
       "premium": true,
       "companies": [
@@ -7612,10 +7341,7 @@
       "id": 118,
       "title": "Sequence Reconstruction",
       "slug": "sequence-reconstruction",
-      "pattern": [
-        "Graph",
-        "Topological Sort"
-      ],
+      "pattern": ["Graph", "Topological Sort"],
       "difficulty": "Medium",
       "premium": true,
       "companies": []
@@ -7624,9 +7350,7 @@
       "id": 119,
       "title": "Binary Tree Level Order Traversal II",
       "slug": "binary-tree-level-order-traversal-ii",
-      "pattern": [
-        "BFS"
-      ],
+      "pattern": ["BFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": []
@@ -7635,9 +7359,7 @@
       "id": 120,
       "title": "Average of Levels in Binary Tree",
       "slug": "average-of-levels-in-binary-tree",
-      "pattern": [
-        "BFS"
-      ],
+      "pattern": ["BFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -7652,10 +7374,7 @@
       "id": 121,
       "title": "Minimum Depth of Binary Tree",
       "slug": "minimum-depth-of-binary-tree",
-      "pattern": [
-        "BFS",
-        "DFS"
-      ],
+      "pattern": ["BFS", "DFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -7675,9 +7394,7 @@
       "id": 122,
       "title": "Binary Tree Level Order Traversal",
       "slug": "binary-tree-level-order-traversal",
-      "pattern": [
-        "BFS"
-      ],
+      "pattern": ["BFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7752,9 +7469,7 @@
       "id": 123,
       "title": "Binary Tree Zigzag Level Order Traversal",
       "slug": "binary-tree-zigzag-level-order-traversal",
-      "pattern": [
-        "BFS"
-      ],
+      "pattern": ["BFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7819,10 +7534,7 @@
       "id": 124,
       "title": "Binary Tree Right Side View",
       "slug": "binary-tree-right-side-view",
-      "pattern": [
-        "BFS",
-        "DFS"
-      ],
+      "pattern": ["BFS", "DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7877,10 +7589,7 @@
       "id": 125,
       "title": "All Nodes Distance K in Binary Tree",
       "slug": "all-nodes-distance-k-in-binary-tree",
-      "pattern": [
-        "BFS",
-        "DFS"
-      ],
+      "pattern": ["BFS", "DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -7920,9 +7629,7 @@
       "id": 126,
       "title": "Same Tree",
       "slug": "same-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -7967,9 +7674,7 @@
       "id": 127,
       "title": "Path Sum",
       "slug": "path-sum",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -8009,9 +7714,7 @@
       "id": 128,
       "title": "Maximum Depth of Binary Tree",
       "slug": "maximum-depth-of-binary-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -8051,9 +7754,7 @@
       "id": 129,
       "title": "Diameter of Binary Tree",
       "slug": "diameter-of-binary-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -8103,9 +7804,7 @@
       "id": 130,
       "title": "Merge Two Binary Trees",
       "slug": "merge-two-binary-trees",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -8125,9 +7824,7 @@
       "id": 131,
       "title": "Lowest Common Ancestor of a Binary Search Tree",
       "slug": "lowest-common-ancestor-of-a-binary-search-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -8167,9 +7864,7 @@
       "id": 132,
       "title": "Subtree of Another Tree",
       "slug": "subtree-of-another-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -8199,9 +7894,7 @@
       "id": 133,
       "title": "Invert Binary Tree",
       "slug": "invert-binary-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -8221,9 +7914,7 @@
       "id": 134,
       "title": "Path Sum II",
       "slug": "path-sum-ii",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -8258,9 +7949,7 @@
       "id": 135,
       "title": "Path Sum III",
       "slug": "path-sum-iii",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -8305,9 +7994,7 @@
       "id": 136,
       "title": "Lowest Common Ancestor of a Binary Tree",
       "slug": "lowest-common-ancestor-of-a-binary-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -8377,9 +8064,7 @@
       "id": 137,
       "title": "Maximum Binary Tree",
       "slug": "maximum-binary-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": []
@@ -8388,9 +8073,7 @@
       "id": 138,
       "title": "Maximum Width of Binary Tree",
       "slug": "maximum-width-of-binary-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -8420,9 +8103,7 @@
       "id": 139,
       "title": "Construct Binary Tree from Preorder and Inorder Traversal",
       "slug": "construct-binary-tree-from-preorder-and-inorder-traversal",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -8472,9 +8153,7 @@
       "id": 140,
       "title": "Validate Binary Search Tree",
       "slug": "validate-binary-search-tree",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -8564,10 +8243,7 @@
       "id": 141,
       "title": "Implement Trie (Prefix Tree)",
       "slug": "implement-trie-prefix-tree",
-      "pattern": [
-        "Design",
-        "Trie"
-      ],
+      "pattern": ["Design", "Trie"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -8632,9 +8308,7 @@
       "id": 142,
       "title": "Binary Tree Maximum Path Sum",
       "slug": "binary-tree-maximum-path-sum",
-      "pattern": [
-        "DFS"
-      ],
+      "pattern": ["DFS"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -8729,9 +8403,7 @@
       "id": 143,
       "title": "Serialize and Deserialize Binary Tree",
       "slug": "serialize-and-deserialize-binary-tree",
-      "pattern": [
-        "Design"
-      ],
+      "pattern": ["Design"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -8791,10 +8463,7 @@
       "id": 144,
       "title": "Word Search II",
       "slug": "word-search-ii",
-      "pattern": [
-        "DFS",
-        "Trie"
-      ],
+      "pattern": ["DFS", "Trie"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -8869,9 +8538,7 @@
       "id": 145,
       "title": "Find Median from Data Stream",
       "slug": "find-median-from-data-stream",
-      "pattern": [
-        "Heap"
-      ],
+      "pattern": ["Heap"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -8951,9 +8618,7 @@
       "id": 146,
       "title": "Sliding Window Median",
       "slug": "sliding-window-median",
-      "pattern": [
-        "Heap"
-      ],
+      "pattern": ["Heap"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -8983,9 +8648,7 @@
       "id": 147,
       "title": "Two Sum",
       "slug": "two-sum",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -9225,9 +8888,7 @@
       "id": 148,
       "title": "Squares of a Sorted Array",
       "slug": "squares-of-a-sorted-array",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -9282,9 +8943,7 @@
       "id": 149,
       "title": "Backspace String Compare",
       "slug": "backspace-string-compare",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -9334,9 +8993,7 @@
       "id": 150,
       "title": "3Sum",
       "slug": "3sum",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -9446,9 +9103,7 @@
       "id": 151,
       "title": "3Sum Closest",
       "slug": "3sum-closest",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -9493,9 +9148,7 @@
       "id": 152,
       "title": "Subarray Product Less Than K",
       "slug": "subarray-product-less-than-k",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -9555,9 +9208,7 @@
       "id": 153,
       "title": "Sort Colors",
       "slug": "sort-colors",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -9642,9 +9293,7 @@
       "id": 154,
       "title": "Trapping Rain Water",
       "slug": "trapping-rain-water",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -9824,9 +9473,7 @@
       "id": 155,
       "title": "Container With Most Water",
       "slug": "container-with-most-water",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -9906,9 +9553,7 @@
       "id": 156,
       "title": "Longest Word in Dictionary",
       "slug": "longest-word-in-dictionary",
-      "pattern": [
-        "Trie"
-      ],
+      "pattern": ["Trie"],
       "difficulty": "Medium",
       "premium": false,
       "companies": []
@@ -9917,9 +9562,7 @@
       "id": 157,
       "title": "Index Pairs of a String",
       "slug": "index-pairs-of-a-string",
-      "pattern": [
-        "Trie"
-      ],
+      "pattern": ["Trie"],
       "difficulty": "Easy",
       "premium": true,
       "companies": []
@@ -9928,9 +9571,7 @@
       "id": 158,
       "title": "Maximum XOR of Two Numbers in an Array",
       "slug": "maximum-xor-of-two-numbers-in-an-array",
-      "pattern": [
-        "Trie"
-      ],
+      "pattern": ["Trie"],
       "difficulty": "Medium",
       "premium": false,
       "companies": [
@@ -9955,9 +9596,7 @@
       "id": 159,
       "title": "Concatenated Words",
       "slug": "concatenated-words",
-      "pattern": [
-        "Trie"
-      ],
+      "pattern": ["Trie"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -9987,9 +9626,7 @@
       "id": 160,
       "title": "Prefix and Suffix Search",
       "slug": "prefix-and-suffix-search",
-      "pattern": [
-        "Trie"
-      ],
+      "pattern": ["Trie"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -10004,9 +9641,7 @@
       "id": 161,
       "title": "Palindrome Pairs",
       "slug": "palindrome-pairs",
-      "pattern": [
-        "Trie"
-      ],
+      "pattern": ["Trie"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -10031,9 +9666,7 @@
       "id": 162,
       "title": "Design Search Autocomplete System",
       "slug": "design-search-autocomplete-system",
-      "pattern": [
-        "Trie"
-      ],
+      "pattern": ["Trie"],
       "difficulty": "Hard",
       "premium": true,
       "companies": [
@@ -10083,9 +9716,7 @@
       "id": 163,
       "title": "Word Squares",
       "slug": "word-squares",
-      "pattern": [
-        "Trie"
-      ],
+      "pattern": ["Trie"],
       "difficulty": "Hard",
       "premium": true,
       "companies": []
@@ -10094,11 +9725,7 @@
       "id": 164,
       "title": "Sort Items by Groups Respecting Dependencies",
       "slug": "sort-items-by-groups-respecting-dependencies",
-      "pattern": [
-        "DFS",
-        "Graph",
-        "Topological Sort"
-      ],
+      "pattern": ["DFS", "Graph", "Topological Sort"],
       "difficulty": "Hard",
       "premium": false,
       "companies": []
@@ -10107,9 +9734,7 @@
       "id": 165,
       "title": "Median of Two Sorted Arrays",
       "slug": "median-of-two-sorted-arrays",
-      "pattern": [
-        "Binary Search"
-      ],
+      "pattern": ["Binary Search"],
       "difficulty": "Hard",
       "premium": false,
       "companies": [
@@ -10224,9 +9849,7 @@
       "id": 166,
       "title": "Majority Element",
       "slug": "majority-element",
-      "pattern": [
-        "Sorting"
-      ],
+      "pattern": ["Sorting"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -10306,9 +9929,7 @@
       "id": 167,
       "title": "Convert 1D Array Into 2D Array",
       "slug": "convert-1d-array-into-2d-array",
-      "pattern": [
-        "Arrays"
-      ],
+      "pattern": ["Arrays"],
       "difficulty": "Easy",
       "premium": false,
       "companies": []
@@ -10317,10 +9938,7 @@
       "id": 168,
       "title": "Move Zeroes",
       "slug": "move-zeroes",
-      "pattern": [
-        "Arrays",
-        "Two Pointers"
-      ],
+      "pattern": ["Arrays", "Two Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -10440,9 +10058,7 @@
       "id": 169,
       "title": "Is Subsequence",
       "slug": "is-subsequence",
-      "pattern": [
-        "Two Pointers"
-      ],
+      "pattern": ["Two Pointers"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -10502,10 +10118,7 @@
       "id": 170,
       "title": "Binary Tree Paths",
       "slug": "binary-tree-paths",
-      "pattern": [
-        "DFS",
-        "Backtracking"
-      ],
+      "pattern": ["DFS", "Backtracking"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -10525,10 +10138,7 @@
       "id": 171,
       "title": "Factor Combinations",
       "slug": "factor-combinations",
-      "pattern": [
-        "Arrays",
-        "Backtracking"
-      ],
+      "pattern": ["Arrays", "Backtracking"],
       "difficulty": "Medium",
       "premium": true,
       "companies": []
@@ -10537,9 +10147,7 @@
       "id": 172,
       "title": "Split a String Into the Max Number of Unique Substrings",
       "slug": "split-a-string-into-the-max-number-of-unique-substrings",
-      "pattern": [
-        "Backtracking"
-      ],
+      "pattern": ["Backtracking"],
       "difficulty": "Medium",
       "premium": false,
       "companies": []
@@ -10548,9 +10156,7 @@
       "id": 173,
       "title": "Maximum Average Subarray I",
       "slug": "maximum-average-subarray-i",
-      "pattern": [
-        "Sliding Window"
-      ],
+      "pattern": ["Sliding Window"],
       "difficulty": "Easy",
       "premium": false,
       "companies": [
@@ -10577,4 +10183,4 @@
       ]
     }
   ]
-}
\ No newline at end of file
+}