{
  "Week 1": [
    {
      "slug": "two-sum",
      "title": "Two Sum",
      "url": "https://leetcode.com/problems/two-sum",
      "duration": 15,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 1,
      "likes": 0.867,
      "companies": 0.995,
      "leetCodeScore": 86.3,
      "priority": 0,
      "id": 1,
      "topic": "array",
      "routines": ["hashing"]
    },
    {
      "slug": "valid-parentheses",
      "title": "Valid Parentheses",
      "url": "https://leetcode.com/problems/valid-parentheses",
      "duration": 20,
      "epi": 3,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.994,
      "likes": 0.778,
      "companies": 0.99,
      "leetCodeScore": 76.6,
      "priority": 0,
      "id": 20,
      "topic": "stack",
      "routines": []
    },
    {
      "slug": "merge-two-sorted-lists",
      "title": "Merge Two Sorted Lists",
      "url": "https://leetcode.com/problems/merge-two-sorted-lists",
      "duration": 20,
      "epi": 0,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.964,
      "likes": 0.545,
      "companies": 0.983,
      "leetCodeScore": 51.6,
      "priority": 0,
      "id": 21,
      "topic": "linked-list",
      "routines": []
    },
    {
      "slug": "best-time-to-buy-and-sell-stock",
      "title": "Best Time to Buy and Sell Stock",
      "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock",
      "duration": 20,
      "epi": 0,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.996,
      "likes": 0.852,
      "companies": 0.995,
      "leetCodeScore": 84.4,
      "priority": 0,
      "id": 121,
      "topic": "array",
      "routines": []
    },
    {
      "slug": "valid-palindrome",
      "title": "Valid Palindrome",
      "url": "https://leetcode.com/problems/valid-palindrome",
      "duration": 15,
      "epi": 2,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.944,
      "likes": 0.083,
      "companies": 0.9,
      "leetCodeScore": 7.1,
      "priority": 0,
      "id": 125,
      "topic": "string",
      "routines": ["palindrome"]
    },
    {
      "slug": "invert-binary-tree",
      "title": "Invert Binary Tree",
      "url": "https://leetcode.com/problems/invert-binary-tree",
      "duration": 15,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.791,
      "likes": 0.988,
      "companies": 0.928,
      "leetCodeScore": 72.5,
      "priority": 0,
      "id": 226,
      "topic": "binary-tree",
      "routines": []
    },
    {
      "slug": "valid-anagram",
      "title": "Valid Anagram",
      "url": "https://leetcode.com/problems/valid-anagram",
      "duration": 15,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.889,
      "likes": 0.758,
      "companies": 0.966,
      "leetCodeScore": 65.1,
      "priority": 0,
      "id": 242,
      "topic": "string",
      "routines": ["anagram"]
    },
    {
      "slug": "binary-search",
      "title": "Binary Search",
      "url": "https://leetcode.com/problems/binary-search",
      "duration": 15,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.977,
      "likes": 0.913,
      "companies": 0.95,
      "leetCodeScore": 84.7,
      "priority": 0,
      "id": 792,
      "topic": "binary-search",
      "routines": []
    },
    {
      "slug": "flood-fill",
      "title": "Flood Fill",
      "url": "https://leetcode.com/problems/flood-fill",
      "duration": 20,
      "epi": 2,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.729,
      "likes": 0.531,
      "companies": 0.9,
      "leetCodeScore": 34.8,
      "priority": 0,
      "id": 733,
      "topic": "graph",
      "routines": ["matrix", "depth-first-search"]
    },
    {
      "slug": "maximum-subarray",
      "title": "Maximum Subarray",
      "url": "https://leetcode.com/problems/maximum-subarray",
      "duration": 20,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.995,
      "likes": 0.745,
      "companies": 0.998,
      "leetCodeScore": 74,
      "priority": 0,
      "id": 53,
      "topic": "dynamic-programming",
      "routines": []
    },
    {
      "slug": "lowest-common-ancestor-of-a-binary-search-tree",
      "title": "Lowest Common Ancestor of a Binary Search Tree",
      "url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree",
      "duration": 20,
      "epi": 1,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.711,
      "likes": 0.853,
      "companies": 0.9,
      "leetCodeScore": 54.6,
      "priority": 0,
      "id": 235,
      "topic": "binary-search-tree",
      "routines": []
    },
    {
      "slug": "insert-interval",
      "title": "Insert Interval",
      "url": "https://leetcode.com/problems/insert-interval",
      "duration": 25,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.807,
      "likes": 0.612,
      "companies": 0.861,
      "leetCodeScore": 42.5,
      "priority": 0,
      "id": 57,
      "topic": "array",
      "routines": ["interval"]
    }
  ],
  "Week 2": [
    {
      "slug": "01-matrix",
      "title": "01 Matrix",
      "url": "https://leetcode.com/problems/01-matrix",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.654,
      "likes": 0.737,
      "companies": 0.861,
      "leetCodeScore": 41.5,
      "priority": 0,
      "id": 542,
      "topic": "graph",
      "routines": ["breadth-first-search"]
    },
    {
      "slug": "k-closest-points-to-origin",
      "title": "K Closest Points to Origin",
      "url": "https://leetcode.com/problems/k-closest-points-to-origin",
      "duration": 30,
      "epi": 1,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.985,
      "likes": 0.812,
      "companies": 0.928,
      "leetCodeScore": 74.2,
      "priority": 0,
      "id": 1014,
      "topic": "heap",
      "routines": ["geometry"]
    },
    {
      "slug": "balanced-binary-tree",
      "title": "Balanced Binary Tree",
      "url": "https://leetcode.com/problems/balanced-binary-tree",
      "duration": 15,
      "epi": 0,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.556,
      "likes": 0.702,
      "companies": 0.808,
      "leetCodeScore": 31.5,
      "priority": 1,
      "id": 110,
      "topic": "binary-tree",
      "routines": []
    },
    {
      "slug": "linked-list-cycle",
      "title": "Linked List Cycle",
      "url": "https://leetcode.com/problems/linked-list-cycle",
      "duration": 20,
      "epi": 1,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.828,
      "likes": 0.517,
      "companies": 0.966,
      "leetCodeScore": 41.4,
      "priority": 1,
      "id": 141,
      "topic": "linked-list",
      "routines": ["two-pointers"]
    },
    {
      "slug": "implement-queue-using-stacks",
      "title": "Implement Queue using Stacks",
      "url": "https://leetcode.com/problems/implement-queue-using-stacks",
      "duration": 20,
      "epi": 3,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.714,
      "likes": 0.626,
      "companies": 0.808,
      "leetCodeScore": 36.1,
      "priority": 1,
      "id": 232,
      "topic": "stack",
      "routines": []
    },
    {
      "slug": "first-bad-version",
      "title": "First Bad Version",
      "url": "https://leetcode.com/problems/first-bad-version",
      "duration": 20,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.913,
      "likes": 0.235,
      "companies": 0.966,
      "leetCodeScore": 20.7,
      "priority": 1,
      "id": 278,
      "topic": "binary-search",
      "routines": []
    },
    {
      "slug": "ransom-note",
      "title": "Ransom Note",
      "url": "https://leetcode.com/problems/ransom-note",
      "duration": 15,
      "epi": 0,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.585,
      "likes": 0.352,
      "companies": 0.808,
      "leetCodeScore": 16.6,
      "priority": 1,
      "id": 383,
      "topic": "hash-table",
      "routines": []
    },
    {
      "slug": "longest-substring-without-repeating-characters",
      "title": "Longest Substring Without Repeating Characters",
      "url": "https://leetcode.com/problems/longest-substring-without-repeating-characters",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.995,
      "likes": 0.766,
      "companies": 0.983,
      "leetCodeScore": 74.9,
      "priority": 1,
      "id": 3,
      "topic": "string",
      "routines": ["sliding-window"]
    },
    {
      "slug": "3sum",
      "title": "3Sum",
      "url": "https://leetcode.com/problems/3sum",
      "duration": 30,
      "epi": 0,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.991,
      "likes": 0.527,
      "companies": 0.995,
      "leetCodeScore": 52,
      "priority": 1,
      "id": 15,
      "topic": "array",
      "routines": ["two-pointers"]
    },
    {
      "slug": "binary-tree-level-order-traversal",
      "title": "Binary Tree Level Order Traversal",
      "url": "https://leetcode.com/problems/binary-tree-level-order-traversal",
      "duration": 20,
      "epi": 1,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.805,
      "likes": 0.947,
      "companies": 0.966,
      "leetCodeScore": 73.6,
      "priority": 1,
      "id": 102,
      "topic": "binary-tree",
      "routines": []
    }
  ],
  "Week 3": [
    {
      "slug": "clone-graph",
      "title": "Clone Graph",
      "url": "https://leetcode.com/problems/clone-graph",
      "duration": 25,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.88,
      "likes": 0.216,
      "companies": 0.966,
      "leetCodeScore": 18.4,
      "priority": 1,
      "id": 133,
      "topic": "graph",
      "routines": ["depth-first-search", "breadth-first-search"]
    },
    {
      "slug": "evaluate-reverse-polish-notation",
      "title": "Evaluate Reverse Polish Notation",
      "url": "https://leetcode.com/problems/evaluate-reverse-polish-notation",
      "duration": 30,
      "epi": 2,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.897,
      "likes": 0.315,
      "companies": 0.9,
      "leetCodeScore": 25.4,
      "priority": 1,
      "id": 150,
      "topic": "stack",
      "routines": []
    },
    {
      "slug": "course-schedule",
      "title": "Course Schedule",
      "url": "https://leetcode.com/problems/course-schedule",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.923,
      "likes": 0.803,
      "companies": 0.928,
      "leetCodeScore": 68.8,
      "priority": 1,
      "id": 207,
      "topic": "graph",
      "routines": ["topo-sort"]
    },
    {
      "slug": "implement-trie-prefix-tree",
      "title": "Implement Trie (Prefix Tree)",
      "url": "https://leetcode.com/problems/implement-trie-prefix-tree",
      "duration": 35,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.855,
      "likes": 0.99,
      "companies": 0.95,
      "leetCodeScore": 80.4,
      "priority": 1,
      "id": 208,
      "topic": "trie",
      "routines": []
    },
    {
      "slug": "coin-change",
      "title": "Coin Change",
      "url": "https://leetcode.com/problems/coin-change",
      "duration": 25,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.94,
      "likes": 0.917,
      "companies": 0.928,
      "leetCodeScore": 80,
      "priority": 1,
      "id": 322,
      "topic": "dynamic-programming",
      "routines": []
    },
    {
      "slug": "product-of-array-except-self",
      "title": "Product of Array Except Self",
      "url": "https://leetcode.com/problems/product-of-array-except-self",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.97,
      "likes": 0.658,
      "companies": 0.995,
      "leetCodeScore": 63.5,
      "priority": 1,
      "id": 238,
      "topic": "array",
      "routines": ["prefix-sum"]
    },
    {
      "slug": "climbing-stairs",
      "title": "Climbing Stairs",
      "url": "https://leetcode.com/problems/climbing-stairs",
      "duration": 20,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.942,
      "likes": 0.871,
      "companies": 0.99,
      "leetCodeScore": 81.2,
      "priority": 2,
      "id": 70,
      "topic": "dynamic-programming",
      "routines": []
    },
    {
      "slug": "longest-palindrome",
      "title": "Longest Palindrome",
      "url": "https://leetcode.com/problems/longest-palindrome",
      "duration": 20,
      "epi": 2,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.482,
      "likes": 0.67,
      "companies": 0,
      "leetCodeScore": 0,
      "priority": 2,
      "id": 409,
      "topic": "string",
      "routines": ["palindrome"]
    },
    {
      "slug": "min-stack",
      "title": "Min Stack",
      "url": "https://leetcode.com/problems/min-stack",
      "duration": 20,
      "epi": 0,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.892,
      "likes": 0.588,
      "companies": 0.983,
      "leetCodeScore": 51.6,
      "priority": 2,
      "id": 155,
      "topic": "stack",
      "routines": []
    }
  ],
  "Week 4": [
    {
      "slug": "reverse-linked-list",
      "title": "Reverse Linked List",
      "url": "https://leetcode.com/problems/reverse-linked-list",
      "duration": 20,
      "epi": 1,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.899,
      "likes": 0.969,
      "companies": 0.966,
      "leetCodeScore": 84.2,
      "priority": 2,
      "id": 206,
      "topic": "linked-list",
      "routines": []
    },
    {
      "slug": "validate-binary-search-tree",
      "title": "Validate Binary Search Tree",
      "url": "https://leetcode.com/problems/validate-binary-search-tree",
      "duration": 20,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.876,
      "likes": 0.533,
      "companies": 0.966,
      "leetCodeScore": 45.1,
      "priority": 2,
      "id": 98,
      "topic": "binary-search-tree",
      "routines": []
    },
    {
      "slug": "number-of-islands",
      "title": "Number of Islands",
      "url": "https://leetcode.com/problems/number-of-islands",
      "duration": 25,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.998,
      "likes": 0.916,
      "companies": 1,
      "leetCodeScore": 91.4,
      "priority": 2,
      "id": 200,
      "topic": "graph",
      "routines": ["depth-first-search", " breadth-first-search"]
    },
    {
      "slug": "rotting-oranges",
      "title": "Rotting Oranges",
      "url": "https://leetcode.com/problems/rotting-oranges",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.937,
      "likes": 0.779,
      "companies": 0.928,
      "leetCodeScore": 67.7,
      "priority": 2,
      "id": 1036,
      "topic": "graph",
      "routines": ["breadth-first-search"]
    },
    {
      "slug": "search-in-rotated-sorted-array",
      "title": "Search in Rotated Sorted Array",
      "url": "https://leetcode.com/problems/search-in-rotated-sorted-array",
      "duration": 30,
      "epi": 2,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.98,
      "likes": 0.637,
      "companies": 0.99,
      "leetCodeScore": 61.8,
      "priority": 2,
      "id": 33,
      "topic": "binary-search",
      "routines": []
    },
    {
      "slug": "combination-sum",
      "title": "Combination Sum",
      "url": "https://leetcode.com/problems/combination-sum",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.939,
      "likes": 0.937,
      "companies": 0.928,
      "leetCodeScore": 81.6,
      "priority": 2,
      "id": 39,
      "topic": "array",
      "routines": ["backtracking"]
    },
    {
      "slug": "permutations",
      "title": "Permutations",
      "url": "https://leetcode.com/problems/permutations",
      "duration": 30,
      "epi": 2,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.916,
      "likes": 0.958,
      "companies": 0.99,
      "leetCodeScore": 86.9,
      "priority": 2,
      "id": 46,
      "topic": "recursion",
      "routines": ["backtracking"]
    },
    {
      "slug": "merge-intervals",
      "title": "Merge Intervals",
      "url": "https://leetcode.com/problems/merge-intervals",
      "duration": 30,
      "epi": 3,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.999,
      "likes": 0.806,
      "companies": 0.998,
      "leetCodeScore": 80.4,
      "priority": 2,
      "id": 56,
      "topic": "array",
      "routines": ["interval"]
    },
    {
      "slug": "lowest-common-ancestor-of-a-binary-tree",
      "title": "Lowest Common Ancestor of a Binary Tree",
      "url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree",
      "duration": 25,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.988,
      "likes": 0.885,
      "companies": 0.966,
      "leetCodeScore": 84.5,
      "priority": 2,
      "id": 236,
      "topic": "binary-tree",
      "routines": []
    }
  ],
  "Week 5": [
    {
      "slug": "time-based-key-value-store",
      "title": "Time Based Key-Value Store",
      "url": "https://leetcode.com/problems/time-based-key-value-store",
      "duration": 35,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.969,
      "likes": 0.505,
      "companies": 0.9,
      "leetCodeScore": 44,
      "priority": 2,
      "id": 1023,
      "topic": "binary-search",
      "routines": []
    },
    {
      "slug": "minimum-window-substring",
      "title": "Minimum Window Substring",
      "url": "https://leetcode.com/problems/minimum-window-substring",
      "duration": 30,
      "epi": 3,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.916,
      "likes": 0.704,
      "companies": 0.966,
      "leetCodeScore": 62.3,
      "priority": 2,
      "id": 76,
      "topic": "string",
      "routines": ["sliding-window"]
    },
    {
      "slug": "serialize-and-deserialize-binary-tree",
      "title": "Serialize and Deserialize Binary Tree",
      "url": "https://leetcode.com/problems/serialize-and-deserialize-binary-tree",
      "duration": 40,
      "epi": null,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.967,
      "likes": 0.817,
      "companies": 0.95,
      "leetCodeScore": 75.1,
      "priority": 2,
      "id": 297,
      "topic": "binary-tree",
      "routines": []
    },
    {
      "slug": "trapping-rain-water",
      "title": "Trapping Rain Water",
      "url": "https://leetcode.com/problems/trapping-rain-water",
      "duration": 35,
      "epi": null,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.998,
      "likes": 0.985,
      "companies": 0.99,
      "leetCodeScore": 97.3,
      "priority": 2,
      "id": 42,
      "topic": "stack",
      "routines": ["monotonic-stack"]
    },
    {
      "slug": "find-median-from-data-stream",
      "title": "Find Median from Data Stream",
      "url": "https://leetcode.com/problems/find-median-from-data-stream",
      "duration": 30,
      "epi": 3,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.955,
      "likes": 0.956,
      "companies": 0.966,
      "leetCodeScore": 88.2,
      "priority": 2,
      "id": 295,
      "topic": "heap",
      "routines": []
    },
    {
      "slug": "majority-element",
      "title": "Majority Element",
      "url": "https://leetcode.com/problems/majority-element",
      "duration": 20,
      "epi": 2,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.906,
      "likes": 0.832,
      "companies": 0.95,
      "leetCodeScore": 71.6,
      "priority": 3,
      "id": 169,
      "topic": "array",
      "routines": ["sorting"]
    },
    {
      "slug": "add-binary",
      "title": "Add Binary",
      "url": "https://leetcode.com/problems/add-binary",
      "duration": 15,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.859,
      "likes": 0.489,
      "companies": 0.861,
      "leetCodeScore": 36.2,
      "priority": 3,
      "id": 67,
      "topic": "binary",
      "routines": []
    },
    {
      "slug": "diameter-of-binary-tree",
      "title": "Diameter of Binary Tree",
      "url": "https://leetcode.com/problems/diameter-of-binary-tree",
      "duration": 30,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.943,
      "likes": 0.654,
      "companies": 0.95,
      "leetCodeScore": 58.6,
      "priority": 3,
      "id": 543,
      "topic": "binary-tree",
      "routines": []
    }
  ],
  "Week 6": [
    {
      "slug": "middle-of-the-linked-list",
      "title": "Middle of the Linked List",
      "url": "https://leetcode.com/problems/middle-of-the-linked-list",
      "duration": 20,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.796,
      "likes": 0.914,
      "companies": 0.9,
      "leetCodeScore": 65.5,
      "priority": 3,
      "id": 908,
      "topic": "linked-list",
      "routines": ["two-pointers"]
    },
    {
      "slug": "accounts-merge",
      "title": "Accounts Merge",
      "url": "https://leetcode.com/problems/accounts-merge",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.946,
      "likes": 0.36,
      "companies": 0.9,
      "leetCodeScore": 30.7,
      "priority": 3,
      "id": 721,
      "topic": "graph",
      "routines": ["depth-first-search", "union-find"]
    },
    {
      "slug": "sort-colors",
      "title": "Sort Colors",
      "url": "https://leetcode.com/problems/sort-colors",
      "duration": 25,
      "epi": 0,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.869,
      "likes": 0.776,
      "companies": 0.95,
      "leetCodeScore": 64.1,
      "priority": 3,
      "id": 75,
      "topic": "array",
      "routines": ["two-pointers"]
    },
    {
      "slug": "word-break",
      "title": "Word Break",
      "url": "https://leetcode.com/problems/word-break",
      "duration": 30,
      "epi": 2,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.951,
      "likes": 0.768,
      "companies": 0.966,
      "leetCodeScore": 70.6,
      "priority": 3,
      "id": 139,
      "topic": "trie",
      "routines": []
    },
    {
      "slug": "partition-equal-subset-sum",
      "title": "Partition Equal Subset Sum",
      "url": "https://leetcode.com/problems/partition-equal-subset-sum",
      "duration": 30,
      "epi": 2,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.882,
      "likes": 0.975,
      "companies": 0.95,
      "leetCodeScore": 81.7,
      "priority": 3,
      "id": 416,
      "topic": "dynamic-programming",
      "routines": []
    },
    {
      "slug": "string-to-integer-atoi",
      "title": "String to Integer (atoi)",
      "url": "https://leetcode.com/problems/string-to-integer-atoi",
      "duration": 25,
      "epi": 0,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.887,
      "likes": 0.033,
      "companies": 0.95,
      "leetCodeScore": 2.8,
      "priority": 3,
      "id": 8,
      "topic": "string",
      "routines": []
    },
    {
      "slug": "spiral-matrix",
      "title": "Spiral Matrix",
      "url": "https://leetcode.com/problems/spiral-matrix",
      "duration": 25,
      "epi": 1,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.976,
      "likes": 0.462,
      "companies": 0.95,
      "leetCodeScore": 42.8,
      "priority": 3,
      "id": 54,
      "topic": "matrix",
      "routines": []
    },
    {
      "slug": "subsets",
      "title": "Subsets",
      "url": "https://leetcode.com/problems/subsets",
      "duration": 30,
      "epi": 3,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.918,
      "likes": 0.975,
      "companies": 0.99,
      "leetCodeScore": 88.6,
      "priority": 3,
      "id": 78,
      "topic": "recursion",
      "routines": ["backtracking"]
    },
    {
      "slug": "binary-tree-right-side-view",
      "title": "Binary Tree Right Side View",
      "url": "https://leetcode.com/problems/binary-tree-right-side-view",
      "duration": 20,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.958,
      "likes": 0.707,
      "companies": 0.928,
      "leetCodeScore": 62.9,
      "priority": 3,
      "id": 199,
      "topic": "binary-tree",
      "routines": []
    }
  ],
  "Week 7": [
    {
      "slug": "longest-palindromic-substring",
      "title": "Longest Palindromic Substring",
      "url": "https://leetcode.com/problems/longest-palindromic-substring",
      "duration": 25,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.99,
      "likes": 0.675,
      "companies": 0.995,
      "leetCodeScore": 66.5,
      "priority": 3,
      "id": 5,
      "topic": "string",
      "routines": ["palindrome", "two-pointer", "dynamic-programming"]
    },
    {
      "slug": "word-ladder",
      "title": "Word Ladder",
      "url": "https://leetcode.com/problems/word-ladder",
      "duration": 45,
      "epi": null,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.974,
      "likes": 0.322,
      "companies": 0.998,
      "leetCodeScore": 31.3,
      "priority": 3,
      "id": 127,
      "topic": "graph",
      "routines": ["breadth-first-search"]
    },
    {
      "slug": "basic-calculator",
      "title": "Basic Calculator",
      "url": "https://leetcode.com/problems/basic-calculator",
      "duration": 40,
      "epi": null,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.96,
      "likes": 0.567,
      "companies": 0.928,
      "leetCodeScore": 50.5,
      "priority": 3,
      "id": 224,
      "topic": "stack",
      "routines": ["parsing"]
    },
    {
      "slug": "maximum-profit-in-job-scheduling",
      "title": "Maximum Profit in Job Scheduling",
      "url": "https://leetcode.com/problems/maximum-profit-in-job-scheduling",
      "duration": 45,
      "epi": null,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.993,
      "likes": 0.993,
      "companies": 0.9,
      "leetCodeScore": 88.7,
      "priority": 3,
      "id": 1352,
      "topic": "binary-search",
      "routines": ["dynamic-programming"]
    },
    {
      "slug": "merge-k-sorted-lists",
      "title": "Merge k Sorted Lists",
      "url": "https://leetcode.com/problems/merge-k-sorted-lists",
      "duration": 30,
      "epi": null,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.986,
      "likes": 0.808,
      "companies": 0.983,
      "leetCodeScore": 78.3,
      "priority": 3,
      "id": 23,
      "topic": "heap",
      "routines": []
    },
    {
      "slug": "largest-rectangle-in-histogram",
      "title": "Largest Rectangle in Histogram",
      "url": "https://leetcode.com/problems/largest-rectangle-in-histogram",
      "duration": 35,
      "epi": 3,
      "difficulty": "Hard",
      "premium": false,
      "frequency": 0.957,
      "likes": 0.982,
      "companies": 0.928,
      "leetCodeScore": 87.2,
      "priority": 3,
      "id": 84,
      "topic": "stack",
      "routines": ["monotonic-stack"]
    },
    {
      "slug": "maximum-depth-of-binary-tree",
      "title": "Maximum Depth of Binary Tree",
      "url": "https://leetcode.com/problems/maximum-depth-of-binary-tree",
      "duration": 15,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.715,
      "likes": 0.957,
      "companies": 0.9,
      "leetCodeScore": 61.6,
      "priority": 4,
      "id": 104,
      "topic": "binary-tree",
      "routines": []
    }
  ],
  "Week 8": [
    {
      "slug": "contains-duplicate",
      "title": "Contains Duplicate",
      "url": "https://leetcode.com/problems/contains-duplicate",
      "duration": 15,
      "epi": null,
      "difficulty": "Easy",
      "premium": false,
      "frequency": 0.973,
      "likes": 0.311,
      "companies": 0.966,
      "leetCodeScore": 29.2,
      "priority": 4,
      "id": 217,
      "topic": "array",
      "routines": ["hash-table", "sorting"]
    },
    {
      "slug": "unique-paths",
      "title": "Unique Paths",
      "url": "https://leetcode.com/problems/unique-paths",
      "duration": 20,
      "epi": 2,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.911,
      "likes": 0.843,
      "companies": 0.95,
      "leetCodeScore": 73,
      "priority": 4,
      "id": 62,
      "topic": "dynamic-programming",
      "routines": []
    },
    {
      "slug": "construct-binary-tree-from-preorder-and-inorder-traversal",
      "title": "Construct Binary Tree from Preorder and Inorder Traversal",
      "url": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal",
      "duration": 25,
      "epi": 2,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.797,
      "likes": 0.905,
      "companies": 0.928,
      "leetCodeScore": 66.9,
      "priority": 4,
      "id": 105,
      "topic": "binary-tree",
      "routines": []
    },
    {
      "slug": "container-with-most-water",
      "title": "Container With Most Water",
      "url": "https://leetcode.com/problems/container-with-most-water",
      "duration": 35,
      "epi": 2,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.966,
      "likes": 0.667,
      "companies": 0.966,
      "leetCodeScore": 62.2,
      "priority": 4,
      "id": 11,
      "topic": "array",
      "routines": ["greedy", "two-pointers"]
    },
    {
      "slug": "letter-combinations-of-a-phone-number",
      "title": "Letter Combinations of a Phone Number",
      "url": "https://leetcode.com/problems/letter-combinations-of-a-phone-number",
      "duration": 30,
      "epi": 3,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.975,
      "likes": 0.622,
      "companies": 0.995,
      "leetCodeScore": 60.3,
      "priority": 4,
      "id": 17,
      "topic": "recursion",
      "routines": ["backtracking"]
    },
    {
      "slug": "word-search",
      "title": "Word Search",
      "url": "https://leetcode.com/problems/word-search",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.981,
      "likes": 0.821,
      "companies": 0.99,
      "leetCodeScore": 79.7,
      "priority": 4,
      "id": 79,
      "topic": "graph",
      "routines": ["backtracking"]
    },
    {
      "slug": "find-all-anagrams-in-a-string",
      "title": "Find All Anagrams in a String",
      "url": "https://leetcode.com/problems/find-all-anagrams-in-a-string",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.935,
      "likes": 0.838,
      "companies": 0.983,
      "leetCodeScore": 77,
      "priority": 4,
      "id": 438,
      "topic": "string",
      "routines": ["anagram"]
    },
    {
      "slug": "minimum-height-trees",
      "title": "Minimum Height Trees",
      "url": "https://leetcode.com/problems/minimum-height-trees",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.706,
      "likes": 0.794,
      "companies": 0.808,
      "leetCodeScore": 45.3,
      "priority": 4,
      "id": 310,
      "topic": "graph",
      "routines": ["topo-sort"]
    },
    {
      "slug": "task-scheduler",
      "title": "Task Scheduler",
      "url": "https://leetcode.com/problems/task-scheduler",
      "duration": 35,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.852,
      "likes": 0.344,
      "companies": 0.9,
      "leetCodeScore": 26.4,
      "priority": 4,
      "id": 621,
      "topic": "heap",
      "routines": []
    },
    {
      "slug": "lru-cache",
      "title": "LRU Cache",
      "url": "https://leetcode.com/problems/lru-cache",
      "duration": 30,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 1,
      "likes": 0.813,
      "companies": 0.998,
      "leetCodeScore": 81.1,
      "priority": 4,
      "id": 146,
      "topic": "linked-list",
      "routines": ["hash-table"]
    },
    {
      "slug": "kth-smallest-element-in-a-bst",
      "title": "Kth Smallest Element in a BST",
      "url": "https://leetcode.com/problems/kth-smallest-element-in-a-bst",
      "duration": 25,
      "epi": null,
      "difficulty": "Medium",
      "premium": false,
      "frequency": 0.634,
      "likes": 0.95,
      "companies": 0.861,
      "leetCodeScore": 51.9,
      "priority": 4,
      "id": 230,
      "topic": "binary-search-tree",
      "routines": []
    }
  ]
}
