freeCodeCamp/curriculum/structure/blocks/project-euler-problems-101-to-200.json

{
  "name": "Project Euler Problems 101 to 200",
  "isUpcomingChange": false,
  "dashedName": "project-euler-problems-101-to-200",
  "helpCategory": "Euler",
  "disableLoopProtectTests": true,
  "disableLoopProtectPreview": true,
  "challengeOrder": [
    {
      "id": "5900f3d21000cf542c50fee4",
      "title": "Problem 101: Optimum polynomial"
    },
    {
      "id": "5900f3d21000cf542c50fee5",
      "title": "Problem 102: Triangle containment"
    },
    {
      "id": "5900f3d61000cf542c50fee7",
      "title": "Problem 103: Special subset sums: optimum"
    },
    {
      "id": "5900f3d51000cf542c50fee6",
      "title": "Problem 104: Pandigital Fibonacci ends"
    },
    {
      "id": "5900f3d61000cf542c50fee8",
      "title": "Problem 105: Special subset sums: testing"
    },
    {
      "id": "5900f3d71000cf542c50fee9",
      "title": "Problem 106: Special subset sums: meta-testing"
    },
    {
      "id": "5900f3d91000cf542c50feea",
      "title": "Problem 107: Minimal network"
    },
    {
      "id": "5900f3d91000cf542c50feeb",
      "title": "Problem 108: Diophantine Reciprocals I"
    },
    {
      "id": "5900f3db1000cf542c50feec",
      "title": "Problem 109: Darts"
    },
    {
      "id": "5900f3db1000cf542c50feed",
      "title": "Problem 110: Diophantine Reciprocals II"
    },
    {
      "id": "5900f3db1000cf542c50feee",
      "title": "Problem 111: Primes with runs"
    },
    {
      "id": "5900f3dd1000cf542c50feef",
      "title": "Problem 112: Bouncy numbers"
    },
    {
      "id": "5900f3dd1000cf542c50fef0",
      "title": "Problem 113: Non-bouncy numbers"
    },
    {
      "id": "5900f3e01000cf542c50fef2",
      "title": "Problem 114: Counting block combinations I"
    },
    {
      "id": "5900f3df1000cf542c50fef1",
      "title": "Problem 115: Counting block combinations II"
    },
    {
      "id": "5900f3e01000cf542c50fef3",
      "title": "Problem 116: Red, green or blue tiles"
    },
    {
      "id": "5900f3e21000cf542c50fef4",
      "title": "Problem 117: Red, green, and blue tiles"
    },
    {
      "id": "5900f3e21000cf542c50fef5",
      "title": "Problem 118: Pandigital prime sets"
    },
    {
      "id": "5900f3e41000cf542c50fef6",
      "title": "Problem 119: Digit power sum"
    },
    {
      "id": "5900f3e41000cf542c50fef7",
      "title": "Problem 120: Square remainders"
    },
    {
      "id": "5900f3e51000cf542c50fef8",
      "title": "Problem 121: Disc game prize fund"
    },
    {
      "id": "5900f3e61000cf542c50fef9",
      "title": "Problem 122: Efficient exponentiation"
    },
    {
      "id": "5900f3e71000cf542c50fefa",
      "title": "Problem 123: Prime square remainders"
    },
    {
      "id": "5900f3e81000cf542c50fefb",
      "title": "Problem 124: Ordered radicals"
    },
    {
      "id": "5900f3e91000cf542c50fefc",
      "title": "Problem 125: Palindromic sums"
    },
    {
      "id": "5900f3ea1000cf542c50fefd",
      "title": "Problem 126: Cuboid layers"
    },
    {
      "id": "5900f3ec1000cf542c50fefe",
      "title": "Problem 127: abc-hits"
    },
    {
      "id": "5900f3ec1000cf542c50feff",
      "title": "Problem 128: Hexagonal tile differences"
    },
    {
      "id": "5900f3ef1000cf542c50ff01",
      "title": "Problem 129: Repunit divisibility"
    },
    {
      "id": "5900f3ee1000cf542c50ff00",
      "title": "Problem 130: Composites with prime repunit property"
    },
    {
      "id": "5900f3ef1000cf542c50ff02",
      "title": "Problem 131: Prime cube partnership"
    },
    {
      "id": "5900f3f11000cf542c50ff03",
      "title": "Problem 132: Large repunit factors"
    },
    {
      "id": "5900f3f21000cf542c50ff04",
      "title": "Problem 133: Repunit nonfactors"
    },
    {
      "id": "5900f3f21000cf542c50ff05",
      "title": "Problem 134: Prime pair connection"
    },
    {
      "id": "5900f3f31000cf542c50ff06",
      "title": "Problem 135: Same differences"
    },
    {
      "id": "5900f3f51000cf542c50ff07",
      "title": "Problem 136: Singleton difference"
    },
    {
      "id": "5900f3f51000cf542c50ff08",
      "title": "Problem 137: Fibonacci golden nuggets"
    },
    {
      "id": "5900f3f61000cf542c50ff09",
      "title": "Problem 138: Special isosceles triangles"
    },
    {
      "id": "5900f3f71000cf542c50ff0a",
      "title": "Problem 139: Pythagorean tiles"
    },
    {
      "id": "5900f3fa1000cf542c50ff0c",
      "title": "Problem 140: Modified Fibonacci golden nuggets"
    },
    {
      "id": "5900f3f91000cf542c50ff0b",
      "title": "Problem 141: Investigating progressive numbers, n, which are also square"
    },
    {
      "id": "5900f3fa1000cf542c50ff0d",
      "title": "Problem 142: Perfect Square Collection"
    },
    {
      "id": "5900f3fc1000cf542c50ff0e",
      "title": "Problem 143: Investigating the Torricelli point of a triangle"
    },
    {
      "id": "5900f3fc1000cf542c50ff0f",
      "title": "Problem 144: Investigating multiple reflections of a laser beam"
    },
    {
      "id": "5900f3fd1000cf542c50ff10",
      "title": "Problem 145: How many reversible numbers are there below one-billion?"
    },
    {
      "id": "5900f3fe1000cf542c50ff11",
      "title": "Problem 146: Investigating a Prime Pattern"
    },
    {
      "id": "5900f3ff1000cf542c50ff12",
      "title": "Problem 147: Rectangles in cross-hatched grids"
    },
    {
      "id": "5900f4021000cf542c50ff14",
      "title": "Problem 148: Exploring Pascal's triangle"
    },
    {
      "id": "5900f4021000cf542c50ff13",
      "title": "Problem 149: Searching for a maximum-sum subsequence"
    },
    {
      "id": "5900f4031000cf542c50ff15",
      "title": "Problem 150: Searching a triangular array for a sub-triangle having minimum-sum"
    },
    {
      "id": "5900f4031000cf542c50ff16",
      "title": "Problem 151: Paper sheets of standard sizes: an expected-value problem"
    },
    {
      "id": "5900f4041000cf542c50ff17",
      "title": "Problem 152: Writing one half as a sum of inverse squares"
    },
    {
      "id": "5900f4051000cf542c50ff18",
      "title": "Problem 153: Investigating Gaussian Integers"
    },
    {
      "id": "5900f4071000cf542c50ff19",
      "title": "Problem 154: Exploring Pascal's pyramid"
    },
    {
      "id": "5900f4081000cf542c50ff1a",
      "title": "Problem 155: Counting Capacitor Circuits"
    },
    {
      "id": "5900f4091000cf542c50ff1b",
      "title": "Problem 156: Counting Digits"
    },
    {
      "id": "5900f4091000cf542c50ff1c",
      "title": "Problem 157: Solving the diophantine equation"
    },
    {
      "id": "5900f40a1000cf542c50ff1d",
      "title": "Problem 158: Exploring strings for which only one character comes lexicographically after its neighbor to the left"
    },
    {
      "id": "5900f40c1000cf542c50ff1e",
      "title": "Problem 159: Digital root sums of factorizations"
    },
    {
      "id": "5900f40d1000cf542c50ff1f",
      "title": "Problem 160: Factorial trailing digits"
    },
    {
      "id": "5900f40d1000cf542c50ff20",
      "title": "Problem 161: Triominoes"
    },
    {
      "id": "5900f40e1000cf542c50ff21",
      "title": "Problem 162: Hexadecimal numbers"
    },
    {
      "id": "5900f40f1000cf542c50ff22",
      "title": "Problem 163: Cross-hatched triangles"
    },
    {
      "id": "5900f4111000cf542c50ff23",
      "title": "Problem 164: Numbers for which no three consecutive digits have a sum greater than a given value"
    },
    {
      "id": "5900f4111000cf542c50ff24",
      "title": "Problem 165: Intersections"
    },
    {
      "id": "5900f4131000cf542c50ff25",
      "title": "Problem 166: Criss Cross"
    },
    {
      "id": "5900f4141000cf542c50ff26",
      "title": "Problem 167: Investigating Ulam sequences"
    },
    {
      "id": "5900f4151000cf542c50ff27",
      "title": "Problem 168: Number Rotations"
    },
    {
      "id": "5900f4151000cf542c50ff28",
      "title": "Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2"
    },
    {
      "id": "5900f4161000cf542c50ff29",
      "title": "Problem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products"
    },
    {
      "id": "5900f4181000cf542c50ff2a",
      "title": "Problem 171: Finding numbers for which the sum of the squares of the digits is a square"
    },
    {
      "id": "5900f4181000cf542c50ff2b",
      "title": "Problem 172: Investigating numbers with few repeated digits"
    },
    {
      "id": "5900f41a1000cf542c50ff2c",
      "title": "Problem 173: Using up to one million tiles how many different \"hollow\" square laminae can be formed?"
    },
    {
      "id": "5900f41a1000cf542c50ff2d",
      "title": "Problem 174: Counting the number of \"hollow\" square laminae that can form one, two, three, ... distinct arrangements"
    },
    {
      "id": "5900f41c1000cf542c50ff2e",
      "title": "Problem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2"
    },
    {
      "id": "5900f41c1000cf542c50ff2f",
      "title": "Problem 176: Right-angled triangles that share a cathetus"
    },
    {
      "id": "5900f41e1000cf542c50ff30",
      "title": "Problem 177: Integer angled Quadrilaterals"
    },
    {
      "id": "5900f41e1000cf542c50ff31",
      "title": "Problem 178: Step Numbers"
    },
    {
      "id": "5900f41f1000cf542c50ff32",
      "title": "Problem 179: Consecutive positive divisors"
    },
    {
      "id": "5900f4201000cf542c50ff33",
      "title": "Problem 180: Rational zeros of a function of three variables"
    },
    {
      "id": "5900f4231000cf542c50ff34",
      "title": "Problem 181: Investigating in how many ways objects of two different colors can be grouped"
    },
    {
      "id": "5900f4231000cf542c50ff35",
      "title": "Problem 182: RSA encryption"
    },
    {
      "id": "5900f4231000cf542c50ff36",
      "title": "Problem 183: Maximum product of parts"
    },
    {
      "id": "5900f4241000cf542c50ff37",
      "title": "Problem 184: Triangles containing the origin"
    },
    {
      "id": "5900f4251000cf542c50ff38",
      "title": "Problem 185: Number Mind"
    },
    {
      "id": "5900f4281000cf542c50ff39",
      "title": "Problem 186: Connectedness of a network"
    },
    {
      "id": "5900f4291000cf542c50ff3a",
      "title": "Problem 187: Semiprimes"
    },
    {
      "id": "5900f4291000cf542c50ff3b",
      "title": "Problem 188: The hyperexponentiation of a number"
    },
    {
      "id": "5900f4291000cf542c50ff3c",
      "title": "Problem 189: Tri-coloring a triangular grid"
    },
    {
      "id": "5900f42b1000cf542c50ff3d",
      "title": "Problem 190: Maximizing a weighted product"
    },
    {
      "id": "5900f42b1000cf542c50ff3e",
      "title": "Problem 191: Prize Strings"
    },
    {
      "id": "5900f42c1000cf542c50ff3f",
      "title": "Problem 192: Best Approximations"
    },
    {
      "id": "5900f42f1000cf542c50ff41",
      "title": "Problem 193: Squarefree Numbers"
    },
    {
      "id": "5900f42f1000cf542c50ff40",
      "title": "Problem 194: Colored Configurations"
    },
    {
      "id": "5900f4311000cf542c50ff43",
      "title": "Problem 195: Inscribed circles of triangles with one angle of 60 degrees"
    },
    {
      "id": "5900f4301000cf542c50ff42",
      "title": "Problem 196: Prime triplets"
    },
    {
      "id": "5900f4311000cf542c50ff44",
      "title": "Problem 197: Investigating the behavior of a recursively defined sequence"
    },
    {
      "id": "5900f4331000cf542c50ff45",
      "title": "Problem 198: Ambiguous Numbers"
    },
    {
      "id": "5900f4341000cf542c50ff46",
      "title": "Problem 199: Iterative Circle Packing"
    },
    {
      "id": "5900f4351000cf542c50ff47",
      "title": "Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string \"200\""
    }
  ],
  "blockLayout": "legacy-challenge-list"
}