{
    "componentChunkName": "component---src-templates-introduction-super-block-intro-tsx",
    "path": "/learn/coding-interview-prep/",
    "result": {"data":{"markdownRemark":{"frontmatter":{"certification":"coding-interview-prep","superBlock":"coding-interview-prep","title":"Coding Interview Prep"}},"allChallengeNode":{"edges":[{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/find-the-symmetric-difference","blockName":"Algorithms"},"id":"a3f503de51cf954ede28891d","block":"algorithms","challengeType":5,"title":"Find the Symmetric Difference","order":0,"superBlock":"coding-interview-prep","dashedName":"find-the-symmetric-difference"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/inventory-update","blockName":"Algorithms"},"id":"a56138aff60341a09ed6c480","block":"algorithms","challengeType":5,"title":"Inventory Update","order":0,"superBlock":"coding-interview-prep","dashedName":"inventory-update"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/no-repeats-please","blockName":"Algorithms"},"id":"a7bf700cd123b9a54eef01d5","block":"algorithms","challengeType":5,"title":"No Repeats Please","order":0,"superBlock":"coding-interview-prep","dashedName":"no-repeats-please"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/pairwise","blockName":"Algorithms"},"id":"a3f503de51cfab748ff001aa","block":"algorithms","challengeType":5,"title":"Pairwise","order":0,"superBlock":"coding-interview-prep","dashedName":"pairwise"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/implement-bubble-sort","blockName":"Algorithms"},"id":"8d5123c8c441eddfaeb5bdef","block":"algorithms","challengeType":1,"title":"Implement Bubble Sort","order":0,"superBlock":"coding-interview-prep","dashedName":"implement-bubble-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/implement-selection-sort","blockName":"Algorithms"},"id":"587d8259367417b2b2512c85","block":"algorithms","challengeType":1,"title":"Implement Selection Sort","order":0,"superBlock":"coding-interview-prep","dashedName":"implement-selection-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/implement-insertion-sort","blockName":"Algorithms"},"id":"587d8259367417b2b2512c86","block":"algorithms","challengeType":1,"title":"Implement Insertion Sort","order":0,"superBlock":"coding-interview-prep","dashedName":"implement-insertion-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/implement-quick-sort","blockName":"Algorithms"},"id":"587d825a367417b2b2512c89","block":"algorithms","challengeType":1,"title":"Implement Quick Sort","order":0,"superBlock":"coding-interview-prep","dashedName":"implement-quick-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/implement-merge-sort","blockName":"Algorithms"},"id":"587d825c367417b2b2512c8f","block":"algorithms","challengeType":1,"title":"Implement Merge Sort","order":0,"superBlock":"coding-interview-prep","dashedName":"implement-merge-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/algorithms/implement-binary-search","blockName":"Algorithms"},"id":"61abc7ebf3029b56226de5b6","block":"algorithms","challengeType":1,"title":"Implement Binary Search","order":0,"superBlock":"coding-interview-prep","dashedName":"implement-binary-search"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/typed-arrays","blockName":"Data Structures"},"id":"587d8253367417b2b2512c6a","block":"data-structures","challengeType":1,"title":"Typed Arrays","order":1,"superBlock":"coding-interview-prep","dashedName":"typed-arrays"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/learn-how-a-stack-works","blockName":"Data Structures"},"id":"587d8250367417b2b2512c5e","block":"data-structures","challengeType":1,"title":"Learn how a Stack Works","order":1,"superBlock":"coding-interview-prep","dashedName":"learn-how-a-stack-works"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-stack-class","blockName":"Data Structures"},"id":"587d8250367417b2b2512c5f","block":"data-structures","challengeType":1,"title":"Create a Stack Class","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-stack-class"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-queue-class","blockName":"Data Structures"},"id":"587d8250367417b2b2512c60","block":"data-structures","challengeType":1,"title":"Create a Queue Class","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-queue-class"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-priority-queue-class","blockName":"Data Structures"},"id":"587d8255367417b2b2512c74","block":"data-structures","challengeType":1,"title":"Create a Priority Queue Class","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-priority-queue-class"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-circular-queue","blockName":"Data Structures"},"id":"587d8255367417b2b2512c75","block":"data-structures","challengeType":1,"title":"Create a Circular Queue","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-circular-queue"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-set-class","blockName":"Data Structures"},"id":"8d1323c8c441eddfaeb5bdef","block":"data-structures","challengeType":1,"title":"Create a Set Class","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-set-class"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/perform-a-union-on-two-sets","blockName":"Data Structures"},"id":"587d8253367417b2b2512c6c","block":"data-structures","challengeType":1,"title":"Perform a Union on Two Sets","order":1,"superBlock":"coding-interview-prep","dashedName":"perform-a-union-on-two-sets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data","blockName":"Data Structures"},"id":"587d8253367417b2b2512c6d","block":"data-structures","challengeType":1,"title":"Perform an Intersection on Two Sets of Data","order":1,"superBlock":"coding-interview-prep","dashedName":"perform-an-intersection-on-two-sets-of-data"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data","blockName":"Data Structures"},"id":"587d8254367417b2b2512c6e","block":"data-structures","challengeType":1,"title":"Perform a Difference on Two Sets of Data","order":1,"superBlock":"coding-interview-prep","dashedName":"perform-a-difference-on-two-sets-of-data"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data","blockName":"Data Structures"},"id":"587d8254367417b2b2512c6f","block":"data-structures","challengeType":1,"title":"Perform a Subset Check on Two Sets of Data","order":1,"superBlock":"coding-interview-prep","dashedName":"perform-a-subset-check-on-two-sets-of-data"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-and-add-to-sets-in-es6","blockName":"Data Structures"},"id":"587d8254367417b2b2512c70","block":"data-structures","challengeType":1,"title":"Create and Add to Sets in ES6","order":1,"superBlock":"coding-interview-prep","dashedName":"create-and-add-to-sets-in-es6"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/remove-items-from-a-set-in-es6","blockName":"Data Structures"},"id":"587d8254367417b2b2512c71","block":"data-structures","challengeType":1,"title":"Remove items from a set in ES6","order":1,"superBlock":"coding-interview-prep","dashedName":"remove-items-from-a-set-in-es6"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/use--has-and--size-on-an-es6-set","blockName":"Data Structures"},"id":"587d8255367417b2b2512c72","block":"data-structures","challengeType":1,"title":"Use .has and .size on an ES6 Set","order":1,"superBlock":"coding-interview-prep","dashedName":"use--has-and--size-on-an-es6-set"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration","blockName":"Data Structures"},"id":"587d8255367417b2b2512c73","block":"data-structures","challengeType":1,"title":"Use Spread and Notes for ES5 Set() Integration","order":1,"superBlock":"coding-interview-prep","dashedName":"use-spread-and-notes-for-es5-set-integration"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-map-data-structure","blockName":"Data Structures"},"id":"8d5823c8c441eddfaeb5bdef","block":"data-structures","challengeType":1,"title":"Create a Map Data Structure","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-map-data-structure"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-an-es6-javascript-map","blockName":"Data Structures"},"id":"587d825b367417b2b2512c8d","block":"data-structures","challengeType":1,"title":"Create an ES6 JavaScript Map","order":1,"superBlock":"coding-interview-prep","dashedName":"create-an-es6-javascript-map"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-hash-table","blockName":"Data Structures"},"id":"587d825b367417b2b2512c8e","block":"data-structures","challengeType":1,"title":"Create a Hash Table","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-hash-table"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list","blockName":"Data Structures"},"id":"587d8251367417b2b2512c61","block":"data-structures","challengeType":1,"title":"Work with Nodes in a Linked List","order":1,"superBlock":"coding-interview-prep","dashedName":"work-with-nodes-in-a-linked-list"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-linked-list-class","blockName":"Data Structures"},"id":"587d8251367417b2b2512c62","block":"data-structures","challengeType":1,"title":"Create a Linked List Class","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-linked-list-class"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list","blockName":"Data Structures"},"id":"587d8251367417b2b2512c63","block":"data-structures","challengeType":1,"title":"Remove Elements from a Linked List","order":1,"superBlock":"coding-interview-prep","dashedName":"remove-elements-from-a-linked-list"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/search-within-a-linked-list","blockName":"Data Structures"},"id":"587d8251367417b2b2512c64","block":"data-structures","challengeType":1,"title":"Search within a Linked List","order":1,"superBlock":"coding-interview-prep","dashedName":"search-within-a-linked-list"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index","blockName":"Data Structures"},"id":"587d8251367417b2b2512c65","block":"data-structures","challengeType":1,"title":"Remove Elements from a Linked List by Index","order":1,"superBlock":"coding-interview-prep","dashedName":"remove-elements-from-a-linked-list-by-index"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list","blockName":"Data Structures"},"id":"587d8252367417b2b2512c67","block":"data-structures","challengeType":1,"title":"Add Elements at a Specific Index in a Linked List","order":1,"superBlock":"coding-interview-prep","dashedName":"add-elements-at-a-specific-index-in-a-linked-list"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-doubly-linked-list","blockName":"Data Structures"},"id":"587d825a367417b2b2512c87","block":"data-structures","challengeType":1,"title":"Create a Doubly Linked List","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-doubly-linked-list"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/reverse-a-doubly-linked-list","blockName":"Data Structures"},"id":"587d825a367417b2b2512c88","block":"data-structures","challengeType":1,"title":"Reverse a Doubly Linked List","order":1,"superBlock":"coding-interview-prep","dashedName":"reverse-a-doubly-linked-list"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8257367417b2b2512c7b","block":"data-structures","challengeType":1,"title":"Add a New Element to a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"add-a-new-element-to-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8256367417b2b2512c7a","block":"data-structures","challengeType":1,"title":"Find the Minimum and Maximum Value in a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"find-the-minimum-and-maximum-value-in-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8257367417b2b2512c7c","block":"data-structures","challengeType":1,"title":"Check if an Element is Present in a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"check-if-an-element-is-present-in-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/check-if-tree-is-binary-search-tree","blockName":"Data Structures"},"id":"5cc0c1b32479e176caf3b422","block":"data-structures","challengeType":1,"title":"Check if Tree is Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"check-if-tree-is-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8257367417b2b2512c7d","block":"data-structures","challengeType":1,"title":"Find the Minimum and Maximum Height of a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"find-the-minimum-and-maximum-height-of-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8257367417b2b2512c7e","block":"data-structures","challengeType":1,"title":"Use Depth First Search in a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"use-depth-first-search-in-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8258367417b2b2512c7f","block":"data-structures","challengeType":1,"title":"Use Breadth First Search in a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"use-breadth-first-search-in-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8258367417b2b2512c80","block":"data-structures","challengeType":1,"title":"Delete a Leaf Node in a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"delete-a-leaf-node-in-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8258367417b2b2512c81","block":"data-structures","challengeType":1,"title":"Delete a Node with One Child in a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"delete-a-node-with-one-child-in-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree","blockName":"Data Structures"},"id":"587d8258367417b2b2512c82","block":"data-structures","challengeType":1,"title":"Delete a Node with Two Children in a Binary Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"delete-a-node-with-two-children-in-a-binary-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/invert-a-binary-tree","blockName":"Data Structures"},"id":"587d8259367417b2b2512c83","block":"data-structures","challengeType":1,"title":"Invert a Binary Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"invert-a-binary-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/create-a-trie-search-tree","blockName":"Data Structures"},"id":"587d8259367417b2b2512c84","block":"data-structures","challengeType":1,"title":"Create a Trie Search Tree","order":1,"superBlock":"coding-interview-prep","dashedName":"create-a-trie-search-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/insert-an-element-into-a-max-heap","blockName":"Data Structures"},"id":"587d825a367417b2b2512c8a","block":"data-structures","challengeType":1,"title":"Insert an Element into a Max Heap","order":1,"superBlock":"coding-interview-prep","dashedName":"insert-an-element-into-a-max-heap"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/remove-an-element-from-a-max-heap","blockName":"Data Structures"},"id":"587d825b367417b2b2512c8b","block":"data-structures","challengeType":1,"title":"Remove an Element from a Max Heap","order":1,"superBlock":"coding-interview-prep","dashedName":"remove-an-element-from-a-max-heap"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap","blockName":"Data Structures"},"id":"587d825b367417b2b2512c8c","block":"data-structures","challengeType":1,"title":"Implement Heap Sort with a Min Heap","order":1,"superBlock":"coding-interview-prep","dashedName":"implement-heap-sort-with-a-min-heap"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/adjacency-list","blockName":"Data Structures"},"id":"587d8256367417b2b2512c77","block":"data-structures","challengeType":1,"title":"Adjacency List","order":1,"superBlock":"coding-interview-prep","dashedName":"adjacency-list"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/adjacency-matrix","blockName":"Data Structures"},"id":"587d8256367417b2b2512c78","block":"data-structures","challengeType":1,"title":"Adjacency Matrix","order":1,"superBlock":"coding-interview-prep","dashedName":"adjacency-matrix"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/incidence-matrix","blockName":"Data Structures"},"id":"587d8256367417b2b2512c79","block":"data-structures","challengeType":1,"title":"Incidence Matrix","order":1,"superBlock":"coding-interview-prep","dashedName":"incidence-matrix"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/breadth-first-search","blockName":"Data Structures"},"id":"587d825c367417b2b2512c90","block":"data-structures","challengeType":1,"title":"Breadth-First Search","order":1,"superBlock":"coding-interview-prep","dashedName":"breadth-first-search"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/data-structures/depth-first-search","blockName":"Data Structures"},"id":"587d825d367417b2b2512c96","block":"data-structures","challengeType":1,"title":"Depth-First Search","order":1,"superBlock":"coding-interview-prep","dashedName":"depth-first-search"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/show-the-local-weather","blockName":"Take Home Projects"},"id":"bd7158d8c442eddfaeb5bd10","block":"take-home-projects","challengeType":3,"title":"Show the Local Weather","order":2,"superBlock":"coding-interview-prep","dashedName":"show-the-local-weather"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-wikipedia-viewer","blockName":"Take Home Projects"},"id":"bd7158d8c442eddfaeb5bd19","block":"take-home-projects","challengeType":3,"title":"Build a Wikipedia Viewer","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-wikipedia-viewer"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/use-the-twitch-json-api","blockName":"Take Home Projects"},"id":"bd7158d8c442eddfaeb5bd1f","block":"take-home-projects","challengeType":3,"title":"Use the Twitch JSON API","order":2,"superBlock":"coding-interview-prep","dashedName":"use-the-twitch-json-api"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer","blockName":"Take Home Projects"},"id":"bd7158d8c443edefaeb5bdee","block":"take-home-projects","challengeType":4,"title":"Build an Image Search Abstraction Layer","order":2,"superBlock":"coding-interview-prep","dashedName":"build-an-image-search-abstraction-layer"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game","blockName":"Take Home Projects"},"id":"bd7158d8c442eedfaeb5bd1c","block":"take-home-projects","challengeType":3,"title":"Build a Tic Tac Toe Game","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-tic-tac-toe-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-simon-game","blockName":"Take Home Projects"},"id":"bd7158d8c442eddfaeb5bd1c","block":"take-home-projects","challengeType":3,"title":"Build a Simon Game","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-simon-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-freecodecamp-forum-homepage","blockName":"Take Home Projects"},"id":"bd7156d8c242eddfaeb5bd13","block":"take-home-projects","challengeType":3,"title":"Build a freeCodeCamp Forum Homepage","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-freecodecamp-forum-homepage"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-recipe-box","blockName":"Take Home Projects"},"id":"bd7155d8c242eddfaeb5bd13","block":"take-home-projects","challengeType":3,"title":"Build a Recipe Box","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-recipe-box"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-the-game-of-life","blockName":"Take Home Projects"},"id":"bd7154d8c242eddfaeb5bd13","block":"take-home-projects","challengeType":3,"title":"Build the Game of Life","order":2,"superBlock":"coding-interview-prep","dashedName":"build-the-game-of-life"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game","blockName":"Take Home Projects"},"id":"bd7153d8c242eddfaeb5bd13","block":"take-home-projects","challengeType":3,"title":"Build a Roguelike Dungeon Crawler Game","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-roguelike-dungeon-crawler-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/p2p-video-chat-application","blockName":"Take Home Projects"},"id":"bd7150d8c442eddfafb5bd1c","block":"take-home-projects","challengeType":4,"title":"P2P Video Chat Application","order":2,"superBlock":"coding-interview-prep","dashedName":"p2p-video-chat-application"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph","blockName":"Take Home Projects"},"id":"bd7198d8c242eddfaeb5bd13","block":"take-home-projects","challengeType":3,"title":"Show National Contiguity with a Force Directed Graph","order":2,"superBlock":"coding-interview-prep","dashedName":"show-national-contiguity-with-a-force-directed-graph"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/map-data-across-the-globe","blockName":"Take Home Projects"},"id":"bd7108d8c242eddfaeb5bd13","block":"take-home-projects","challengeType":3,"title":"Map Data Across the Globe","order":2,"superBlock":"coding-interview-prep","dashedName":"map-data-across-the-globe"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/manage-a-book-trading-club","blockName":"Take Home Projects"},"id":"bd7158d8c443eddfaeb5bd0f","block":"take-home-projects","challengeType":4,"title":"Manage a Book Trading Club","order":2,"superBlock":"coding-interview-prep","dashedName":"manage-a-book-trading-club"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-pinterest-clone","blockName":"Take Home Projects"},"id":"bd7158d8c443eddfaeb5bdee","block":"take-home-projects","challengeType":4,"title":"Build a Pinterest Clone","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-pinterest-clone"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app","blockName":"Take Home Projects"},"id":"bd7158d8c443eddfaeb5bdff","block":"take-home-projects","challengeType":4,"title":"Build a Nightlife Coordination App","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-nightlife-coordination-app"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/chart-the-stock-market","blockName":"Take Home Projects"},"id":"bd7158d8c443eddfaeb5bd0e","block":"take-home-projects","challengeType":4,"title":"Chart the Stock Market","order":2,"superBlock":"coding-interview-prep","dashedName":"chart-the-stock-market"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-voting-app","blockName":"Take Home Projects"},"id":"bd7158d8c443eddfaeb5bdef","block":"take-home-projects","challengeType":4,"title":"Build a Voting App","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-voting-app"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-pong-game","blockName":"Take Home Projects"},"id":"5a4b7fcdb66f799f199e11db","block":"take-home-projects","challengeType":3,"title":"Build a Pong Game","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-pong-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/take-home-projects/build-a-light-bright-app","blockName":"Take Home Projects"},"id":"5a5d02bd919fcf9ca8cf46cb","block":"take-home-projects","challengeType":3,"title":"Build a Light-Bright App","order":2,"superBlock":"coding-interview-prep","dashedName":"build-a-light-bright-app"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/100-doors","blockName":"Rosetta Code"},"id":"594810f028c0303b75339acb","block":"rosetta-code","challengeType":5,"title":"100 doors","order":3,"superBlock":"coding-interview-prep","dashedName":"100-doors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/24-game","blockName":"Rosetta Code"},"id":"5951e88f64ebf159166a1176","block":"rosetta-code","challengeType":5,"title":"24 game","order":3,"superBlock":"coding-interview-prep","dashedName":"24-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer","blockName":"Rosetta Code"},"id":"5949b579404977fbaefcd736","block":"rosetta-code","challengeType":5,"title":"9 billion names of God the integer","order":3,"superBlock":"coding-interview-prep","dashedName":"9-billion-names-of-god-the-integer"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/abc-problem","blockName":"Rosetta Code"},"id":"594810f028c0303b75339acc","block":"rosetta-code","challengeType":5,"title":"ABC Problem","order":3,"superBlock":"coding-interview-prep","dashedName":"abc-problem"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications","blockName":"Rosetta Code"},"id":"594810f028c0303b75339acd","block":"rosetta-code","challengeType":5,"title":"Abundant, deficient and perfect number classifications","order":3,"superBlock":"coding-interview-prep","dashedName":"abundant-deficient-and-perfect-number-classifications"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/accumulator-factory","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ace","block":"rosetta-code","challengeType":5,"title":"Accumulator factory","order":3,"superBlock":"coding-interview-prep","dashedName":"accumulator-factory"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/ackermann-function","blockName":"Rosetta Code"},"id":"594810f028c0303b75339acf","block":"rosetta-code","challengeType":5,"title":"Ackermann function","order":3,"superBlock":"coding-interview-prep","dashedName":"ackermann-function"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/align-columns","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad0","block":"rosetta-code","challengeType":5,"title":"Align columns","order":3,"superBlock":"coding-interview-prep","dashedName":"align-columns"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/amicable-pairs","blockName":"Rosetta Code"},"id":"5949b579404977fbaefcd737","block":"rosetta-code","challengeType":5,"title":"Amicable pairs","order":3,"superBlock":"coding-interview-prep","dashedName":"amicable-pairs"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/averagesmode","blockName":"Rosetta Code"},"id":"594d8d0ab97724821379b1e6","block":"rosetta-code","challengeType":5,"title":"Averages/Mode","order":3,"superBlock":"coding-interview-prep","dashedName":"averagesmode"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/averagespythagorean-means","blockName":"Rosetta Code"},"id":"594d966a1467eb84194f0086","block":"rosetta-code","challengeType":5,"title":"Averages/Pythagorean means","order":3,"superBlock":"coding-interview-prep","dashedName":"averagespythagorean-means"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/averagesroot-mean-square","blockName":"Rosetta Code"},"id":"594da033de4190850b893874","block":"rosetta-code","challengeType":5,"title":"Averages/Root mean square","order":3,"superBlock":"coding-interview-prep","dashedName":"averagesroot-mean-square"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/babbage-problem","blockName":"Rosetta Code"},"id":"594db4d0dedb4c06a2a4cefd","block":"rosetta-code","challengeType":5,"title":"Babbage problem","order":3,"superBlock":"coding-interview-prep","dashedName":"babbage-problem"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/balanced-brackets","blockName":"Rosetta Code"},"id":"594dc6c729e5700999302b45","block":"rosetta-code","challengeType":5,"title":"Balanced brackets","order":3,"superBlock":"coding-interview-prep","dashedName":"balanced-brackets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points","blockName":"Rosetta Code"},"id":"5951815dd895584b06884620","block":"rosetta-code","challengeType":5,"title":"Circles of given radius through two points","order":3,"superBlock":"coding-interview-prep","dashedName":"circles-of-given-radius-through-two-points"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/closest-pair-problem","blockName":"Rosetta Code"},"id":"5951a53863c8a34f02bf1bdc","block":"rosetta-code","challengeType":5,"title":"Closest-pair problem","order":3,"superBlock":"coding-interview-prep","dashedName":"closest-pair-problem"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/combinations","blockName":"Rosetta Code"},"id":"5958469238c0d8d2632f46db","block":"rosetta-code","challengeType":5,"title":"Combinations","order":3,"superBlock":"coding-interview-prep","dashedName":"combinations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/comma-quibbling","blockName":"Rosetta Code"},"id":"596e414344c3b2872167f0fe","block":"rosetta-code","challengeType":5,"title":"Comma quibbling","order":3,"superBlock":"coding-interview-prep","dashedName":"comma-quibbling"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/compare-a-list-of-strings","blockName":"Rosetta Code"},"id":"596e457071c35c882915b3e4","block":"rosetta-code","challengeType":5,"title":"Compare a list of strings","order":3,"superBlock":"coding-interview-prep","dashedName":"compare-a-list-of-strings"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration","blockName":"Rosetta Code"},"id":"596fd036dc1ab896c5db98b1","block":"rosetta-code","challengeType":5,"title":"Convert seconds to compound duration","order":3,"superBlock":"coding-interview-prep","dashedName":"convert-seconds-to-compound-duration"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/count-occurrences-of-a-substring","blockName":"Rosetta Code"},"id":"596fda99c69f779975a1b67d","block":"rosetta-code","challengeType":5,"title":"Count occurrences of a substring","order":3,"superBlock":"coding-interview-prep","dashedName":"count-occurrences-of-a-substring"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/count-the-coins","blockName":"Rosetta Code"},"id":"59713bd26bdeb8a594fb9413","block":"rosetta-code","challengeType":5,"title":"Count the coins","order":3,"superBlock":"coding-interview-prep","dashedName":"count-the-coins"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/cramers-rule","blockName":"Rosetta Code"},"id":"59713da0a428c1a62d7db430","block":"rosetta-code","challengeType":5,"title":"Cramer's rule","order":3,"superBlock":"coding-interview-prep","dashedName":"cramers-rule"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/cumulative-standard-deviation","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e03","block":"rosetta-code","challengeType":5,"title":"Cumulative standard deviation","order":3,"superBlock":"coding-interview-prep","dashedName":"cumulative-standard-deviation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/cusip","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e05","block":"rosetta-code","challengeType":5,"title":"CUSIP","order":3,"superBlock":"coding-interview-prep","dashedName":"cusip"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/cut-a-rectangle","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e06","block":"rosetta-code","challengeType":5,"title":"Cut a rectangle","order":3,"superBlock":"coding-interview-prep","dashedName":"cut-a-rectangle"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/date-format","blockName":"Rosetta Code"},"id":"59669d08d75b60482359409f","block":"rosetta-code","challengeType":5,"title":"Date format","order":3,"superBlock":"coding-interview-prep","dashedName":"date-format"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/date-manipulation","blockName":"Rosetta Code"},"id":"5966c21cf732a95f1b67dd28","block":"rosetta-code","challengeType":5,"title":"Date manipulation","order":3,"superBlock":"coding-interview-prep","dashedName":"date-manipulation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/day-of-the-week","blockName":"Rosetta Code"},"id":"5966f99c45e8976909a85575","block":"rosetta-code","challengeType":5,"title":"Day of the week","order":3,"superBlock":"coding-interview-prep","dashedName":"day-of-the-week"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/deal-cards-for-freecell","blockName":"Rosetta Code"},"id":"59694356a6e7011f7f1c5f4e","block":"rosetta-code","challengeType":5,"title":"Deal cards for FreeCell","order":3,"superBlock":"coding-interview-prep","dashedName":"deal-cards-for-freecell"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/deepcopy","blockName":"Rosetta Code"},"id":"596a8888ab7c01048de257d5","block":"rosetta-code","challengeType":5,"title":"Deepcopy","order":3,"superBlock":"coding-interview-prep","dashedName":"deepcopy"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/define-a-primitive-data-type","blockName":"Rosetta Code"},"id":"597089c87eec450c68aa1643","block":"rosetta-code","challengeType":5,"title":"Define a primitive data type","order":3,"superBlock":"coding-interview-prep","dashedName":"define-a-primitive-data-type"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/department-numbers","blockName":"Rosetta Code"},"id":"59f40b17e79dbf1ab720ed7a","block":"rosetta-code","challengeType":5,"title":"Department Numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"department-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/discordian-date","blockName":"Rosetta Code"},"id":"59f4eafba0343628bb682785","block":"rosetta-code","challengeType":5,"title":"Discordian date","order":3,"superBlock":"coding-interview-prep","dashedName":"discordian-date"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/dot-product","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e1e","block":"rosetta-code","challengeType":5,"title":"Dot product","order":3,"superBlock":"coding-interview-prep","dashedName":"dot-product"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/element-wise-operations","blockName":"Rosetta Code"},"id":"599c333915e0ea32d04d4bec","block":"rosetta-code","challengeType":5,"title":"Element-wise operations","order":3,"superBlock":"coding-interview-prep","dashedName":"element-wise-operations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/emirp-primes","blockName":"Rosetta Code"},"id":"599d0ba974141b0f508b37d5","block":"rosetta-code","challengeType":5,"title":"Emirp primes","order":3,"superBlock":"coding-interview-prep","dashedName":"emirp-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/entropy","blockName":"Rosetta Code"},"id":"599d15309e88c813a40baf58","block":"rosetta-code","challengeType":5,"title":"Entropy","order":3,"superBlock":"coding-interview-prep","dashedName":"entropy"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/equilibrium-index","blockName":"Rosetta Code"},"id":"5987fd532b954e0f21b5d3f6","block":"rosetta-code","challengeType":5,"title":"Equilibrium index","order":3,"superBlock":"coding-interview-prep","dashedName":"equilibrium-index"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/ethiopian-multiplication","blockName":"Rosetta Code"},"id":"599d1566a02b571412643b84","block":"rosetta-code","challengeType":5,"title":"Ethiopian multiplication","order":3,"superBlock":"coding-interview-prep","dashedName":"ethiopian-multiplication"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/euler-method","blockName":"Rosetta Code"},"id":"59880443fb36441083c6c20e","block":"rosetta-code","challengeType":5,"title":"Euler method","order":3,"superBlock":"coding-interview-prep","dashedName":"euler-method"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/evaluate-binomial-coefficients","blockName":"Rosetta Code"},"id":"598de241872ef8353c58a7a2","block":"rosetta-code","challengeType":5,"title":"Evaluate binomial coefficients","order":3,"superBlock":"coding-interview-prep","dashedName":"evaluate-binomial-coefficients"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/execute-a-markov-algorithm","blockName":"Rosetta Code"},"id":"59e09e6d412c5939baa02d16","block":"rosetta-code","challengeType":5,"title":"Execute a Markov algorithm","order":3,"superBlock":"coding-interview-prep","dashedName":"execute-a-markov-algorithm"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/execute-brain","blockName":"Rosetta Code"},"id":"59e0a8df964e4540d5abe599","block":"rosetta-code","challengeType":5,"title":"Execute Brain****","order":3,"superBlock":"coding-interview-prep","dashedName":"execute-brain"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/extensible-prime-generator","blockName":"Rosetta Code"},"id":"598ee8b91b410510ae82efef","block":"rosetta-code","challengeType":5,"title":"Extensible prime generator","order":3,"superBlock":"coding-interview-prep","dashedName":"extensible-prime-generator"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/factorial","blockName":"Rosetta Code"},"id":"597b2b2a2702b44414742771","block":"rosetta-code","challengeType":5,"title":"Factorial","order":3,"superBlock":"coding-interview-prep","dashedName":"factorial"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/factors-of-a-mersenne-number","blockName":"Rosetta Code"},"id":"598eea87e5cf4b116c3ff81a","block":"rosetta-code","challengeType":5,"title":"Factors of a Mersenne number","order":3,"superBlock":"coding-interview-prep","dashedName":"factors-of-a-mersenne-number"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/factors-of-an-integer","blockName":"Rosetta Code"},"id":"597f1e7fbc206f0e9ba95dc4","block":"rosetta-code","challengeType":5,"title":"Factors of an integer","order":3,"superBlock":"coding-interview-prep","dashedName":"factors-of-an-integer"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/farey-sequence","blockName":"Rosetta Code"},"id":"59c3ec9f15068017c96eb8a3","block":"rosetta-code","challengeType":5,"title":"Farey sequence","order":3,"superBlock":"coding-interview-prep","dashedName":"farey-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences","blockName":"Rosetta Code"},"id":"598eef80ba501f1268170e1e","block":"rosetta-code","challengeType":5,"title":"Fibonacci n-step number sequences","order":3,"superBlock":"coding-interview-prep","dashedName":"fibonacci-n-step-number-sequences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/fibonacci-sequence","blockName":"Rosetta Code"},"id":"597f24c1dda4e70f53c79c81","block":"rosetta-code","challengeType":5,"title":"Fibonacci sequence","order":3,"superBlock":"coding-interview-prep","dashedName":"fibonacci-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/fibonacci-word","blockName":"Rosetta Code"},"id":"5992e222d397f00d21122931","block":"rosetta-code","challengeType":5,"title":"Fibonacci word","order":3,"superBlock":"coding-interview-prep","dashedName":"fibonacci-word"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/fizzbuzz","blockName":"Rosetta Code"},"id":"5e9ddb06ec35240f39657419","block":"rosetta-code","challengeType":5,"title":"FizzBuzz","order":3,"superBlock":"coding-interview-prep","dashedName":"fizzbuzz"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/fractran","blockName":"Rosetta Code"},"id":"5a7dad05be01840e1778a0d1","block":"rosetta-code","challengeType":5,"title":"Fractran","order":3,"superBlock":"coding-interview-prep","dashedName":"fractran"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/gamma-function","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e76","block":"rosetta-code","challengeType":5,"title":"Gamma function","order":3,"superBlock":"coding-interview-prep","dashedName":"gamma-function"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/gaussian-elimination","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e77","block":"rosetta-code","challengeType":5,"title":"Gaussian elimination","order":3,"superBlock":"coding-interview-prep","dashedName":"gaussian-elimination"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/general-fizzbuzz","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e78","block":"rosetta-code","challengeType":5,"title":"General FizzBuzz","order":3,"superBlock":"coding-interview-prep","dashedName":"general-fizzbuzz"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e7a","block":"rosetta-code","challengeType":5,"title":"Generate lower case ASCII alphabet","order":3,"superBlock":"coding-interview-prep","dashedName":"generate-lower-case-ascii-alphabet"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/generatorexponential","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e7b","block":"rosetta-code","challengeType":5,"title":"Generator/Exponential","order":3,"superBlock":"coding-interview-prep","dashedName":"generatorexponential"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/gray-code","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e80","block":"rosetta-code","challengeType":5,"title":"Gray code","order":3,"superBlock":"coding-interview-prep","dashedName":"gray-code"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/greatest-common-divisor","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e82","block":"rosetta-code","challengeType":5,"title":"Greatest common divisor","order":3,"superBlock":"coding-interview-prep","dashedName":"greatest-common-divisor"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/greatest-subsequential-sum","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7e84","block":"rosetta-code","challengeType":5,"title":"Greatest subsequential sum","order":3,"superBlock":"coding-interview-prep","dashedName":"greatest-subsequential-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/hailstone-sequence","blockName":"Rosetta Code"},"id":"595608ff8bcd7a50bd490181","block":"rosetta-code","challengeType":5,"title":"Hailstone sequence","order":3,"superBlock":"coding-interview-prep","dashedName":"hailstone-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/happy-numbers","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad1","block":"rosetta-code","challengeType":5,"title":"Happy numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"happy-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/harshad-or-niven-series","blockName":"Rosetta Code"},"id":"595668ca4cfe1af2fb9818d4","block":"rosetta-code","challengeType":5,"title":"Harshad or Niven series","order":3,"superBlock":"coding-interview-prep","dashedName":"harshad-or-niven-series"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/hash-from-two-arrays","blockName":"Rosetta Code"},"id":"595671d4d2cdc305f0d5b36f","block":"rosetta-code","challengeType":5,"title":"Hash from two arrays","order":3,"superBlock":"coding-interview-prep","dashedName":"hash-from-two-arrays"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/hash-join","blockName":"Rosetta Code"},"id":"5956795bc9e2c415eb244de1","block":"rosetta-code","challengeType":5,"title":"Hash join","order":3,"superBlock":"coding-interview-prep","dashedName":"hash-join"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/heronian-triangles","blockName":"Rosetta Code"},"id":"595b98f8b5a2245e243aa831","block":"rosetta-code","challengeType":5,"title":"Heronian triangles","order":3,"superBlock":"coding-interview-prep","dashedName":"heronian-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences","blockName":"Rosetta Code"},"id":"59622f89e4e137560018a40e","block":"rosetta-code","challengeType":5,"title":"Hofstadter Figure-Figure sequences","order":3,"superBlock":"coding-interview-prep","dashedName":"hofstadter-figure-figure-sequences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/hofstadter-q-sequence","blockName":"Rosetta Code"},"id":"59637c4d89f6786115efd814","block":"rosetta-code","challengeType":5,"title":"Hofstadter Q sequence","order":3,"superBlock":"coding-interview-prep","dashedName":"hofstadter-q-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/i-before-e-except-after-c","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7eb0","block":"rosetta-code","challengeType":5,"title":"I before E except after C","order":3,"superBlock":"coding-interview-prep","dashedName":"i-before-e-except-after-c"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/iban","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7eaf","block":"rosetta-code","challengeType":5,"title":"IBAN","order":3,"superBlock":"coding-interview-prep","dashedName":"iban"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/identity-matrix","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7eb1","block":"rosetta-code","challengeType":5,"title":"Identity matrix","order":3,"superBlock":"coding-interview-prep","dashedName":"identity-matrix"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/iterated-digits-squaring","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ec1","block":"rosetta-code","challengeType":5,"title":"Iterated digits squaring","order":3,"superBlock":"coding-interview-prep","dashedName":"iterated-digits-squaring"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/jaro-distance","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ec2","block":"rosetta-code","challengeType":5,"title":"Jaro distance","order":3,"superBlock":"coding-interview-prep","dashedName":"jaro-distance"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/jortsort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ec4","block":"rosetta-code","challengeType":5,"title":"JortSort","order":3,"superBlock":"coding-interview-prep","dashedName":"jortsort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/josephus-problem","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ec5","block":"rosetta-code","challengeType":5,"title":"Josephus problem","order":3,"superBlock":"coding-interview-prep","dashedName":"josephus-problem"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/k-d-tree","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ecb","block":"rosetta-code","challengeType":5,"title":"K-d tree","order":3,"superBlock":"coding-interview-prep","dashedName":"k-d-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/kaprekar-numbers","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7eca","block":"rosetta-code","challengeType":5,"title":"Kaprekar numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"kaprekar-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/knapsack-problem0-1","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ed1","block":"rosetta-code","challengeType":5,"title":"Knapsack problem/0-1","order":3,"superBlock":"coding-interview-prep","dashedName":"knapsack-problem0-1"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/knapsack-problembounded","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ed2","block":"rosetta-code","challengeType":5,"title":"Knapsack problem/Bounded","order":3,"superBlock":"coding-interview-prep","dashedName":"knapsack-problembounded"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/knapsack-problemcontinuous","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ed3","block":"rosetta-code","challengeType":5,"title":"Knapsack problem/Continuous","order":3,"superBlock":"coding-interview-prep","dashedName":"knapsack-problemcontinuous"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/knapsack-problemunbounded","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ed4","block":"rosetta-code","challengeType":5,"title":"Knapsack problem/Unbounded","order":3,"superBlock":"coding-interview-prep","dashedName":"knapsack-problemunbounded"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/knights-tour","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ed5","block":"rosetta-code","challengeType":5,"title":"Knight's tour","order":3,"superBlock":"coding-interview-prep","dashedName":"knights-tour"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7edb","block":"rosetta-code","challengeType":5,"title":"Largest int from concatenated ints","order":3,"superBlock":"coding-interview-prep","dashedName":"largest-int-from-concatenated-ints"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/last-letter-first-letter","blockName":"Rosetta Code"},"id":"5e4ce2b6ac708cc68c1df25e","block":"rosetta-code","challengeType":5,"title":"Last letter-first letter","order":3,"superBlock":"coding-interview-prep","dashedName":"last-letter-first-letter"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/last-friday-of-each-month","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7edc","block":"rosetta-code","challengeType":5,"title":"Last Friday of each month","order":3,"superBlock":"coding-interview-prep","dashedName":"last-friday-of-each-month"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/leap-year","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ede","block":"rosetta-code","challengeType":5,"title":"Leap year","order":3,"superBlock":"coding-interview-prep","dashedName":"leap-year"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/least-common-multiple","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7edf","block":"rosetta-code","challengeType":5,"title":"Least common multiple","order":3,"superBlock":"coding-interview-prep","dashedName":"least-common-multiple"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/left-factorials","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ee0","block":"rosetta-code","challengeType":5,"title":"Left factorials","order":3,"superBlock":"coding-interview-prep","dashedName":"left-factorials"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/letter-frequency","blockName":"Rosetta Code"},"id":"5e4ce2bbac708cc68c1df25f","block":"rosetta-code","challengeType":5,"title":"Letter frequency","order":3,"superBlock":"coding-interview-prep","dashedName":"letter-frequency"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/levenshtein-distance","blockName":"Rosetta Code"},"id":"5e4ce2eaac708cc68c1df260","block":"rosetta-code","challengeType":5,"title":"Levenshtein distance","order":3,"superBlock":"coding-interview-prep","dashedName":"levenshtein-distance"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/linear-congruential-generator","blockName":"Rosetta Code"},"id":"5e4ce2f5ac708cc68c1df261","block":"rosetta-code","challengeType":5,"title":"Linear congruential generator","order":3,"superBlock":"coding-interview-prep","dashedName":"linear-congruential-generator"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/long-multiplication","blockName":"Rosetta Code"},"id":"5e4ce2a1ac708cc68c1df25d","block":"rosetta-code","challengeType":5,"title":"Long multiplication","order":3,"superBlock":"coding-interview-prep","dashedName":"long-multiplication"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/longest-common-subsequence","blockName":"Rosetta Code"},"id":"5e6dd1278e6ca105cde40ea9","block":"rosetta-code","challengeType":5,"title":"Longest common subsequence","order":3,"superBlock":"coding-interview-prep","dashedName":"longest-common-subsequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/longest-increasing-subsequence","blockName":"Rosetta Code"},"id":"5e6dd139859c290b6ab80292","block":"rosetta-code","challengeType":5,"title":"Longest increasing subsequence","order":3,"superBlock":"coding-interview-prep","dashedName":"longest-increasing-subsequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/longest-string-challenge","blockName":"Rosetta Code"},"id":"5e6dd14192286d95fc43046e","block":"rosetta-code","challengeType":5,"title":"Longest string challenge","order":3,"superBlock":"coding-interview-prep","dashedName":"longest-string-challenge"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/look-and-say-sequence","blockName":"Rosetta Code"},"id":"5e6dd14797f5ce267c2f19d0","block":"rosetta-code","challengeType":5,"title":"Look-and-say sequence","order":3,"superBlock":"coding-interview-prep","dashedName":"look-and-say-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously","blockName":"Rosetta Code"},"id":"5e6dd15004c88cf00d2a78b3","block":"rosetta-code","challengeType":5,"title":"Loop over multiple arrays simultaneously","order":3,"superBlock":"coding-interview-prep","dashedName":"loop-over-multiple-arrays-simultaneously"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/lu-decomposition","blockName":"Rosetta Code"},"id":"5e6decd8ec8d7db960950d1c","block":"rosetta-code","challengeType":5,"title":"LU decomposition","order":3,"superBlock":"coding-interview-prep","dashedName":"lu-decomposition"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/lucas-lehmer-test","blockName":"Rosetta Code"},"id":"5e6dee7749a0b85a3f1fc7d5","block":"rosetta-code","challengeType":5,"title":"Lucas-Lehmer test","order":3,"superBlock":"coding-interview-prep","dashedName":"lucas-lehmer-test"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/ludic-numbers","blockName":"Rosetta Code"},"id":"5ea281203167d2b0bdefca00","block":"rosetta-code","challengeType":5,"title":"Ludic numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"ludic-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers","blockName":"Rosetta Code"},"id":"5ea28156e79528a9ab248f27","block":"rosetta-code","challengeType":5,"title":"Luhn test of credit card numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"luhn-test-of-credit-card-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/lychrel-numbers","blockName":"Rosetta Code"},"id":"5ea2815a8640bcc6cb7dab3c","block":"rosetta-code","challengeType":5,"title":"Lychrel numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"lychrel-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/lzw-compression","blockName":"Rosetta Code"},"id":"5ea2815e364d9a2222ea55f8","block":"rosetta-code","challengeType":5,"title":"LZW compression","order":3,"superBlock":"coding-interview-prep","dashedName":"lzw-compression"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/s-expressions","blockName":"Rosetta Code"},"id":"59667989bf71cf555dd5d2ff","block":"rosetta-code","challengeType":5,"title":"S-Expressions","order":3,"superBlock":"coding-interview-prep","dashedName":"s-expressions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem","blockName":"Rosetta Code"},"id":"59da22823d04c95919d46269","block":"rosetta-code","challengeType":5,"title":"Sailors, coconuts and a monkey problem","order":3,"superBlock":"coding-interview-prep","dashedName":"sailors-coconuts-and-a-monkey-problem"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/search-a-list-of-records","blockName":"Rosetta Code"},"id":"5eb3e497b8d6d7f63c5517ea","block":"rosetta-code","challengeType":5,"title":"Search a list of records","order":3,"superBlock":"coding-interview-prep","dashedName":"search-a-list-of-records"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sedols","blockName":"Rosetta Code"},"id":"59d9c6bc214c613ba73ff012","block":"rosetta-code","challengeType":5,"title":"SEDOLs","order":3,"superBlock":"coding-interview-prep","dashedName":"sedols"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/self-describing-numbers","blockName":"Rosetta Code"},"id":"5eaf48389ee512d4d103684b","block":"rosetta-code","challengeType":5,"title":"Self Describing Numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"self-describing-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/self-referential-sequence","blockName":"Rosetta Code"},"id":"5eb3e4a21f462f409d656c73","block":"rosetta-code","challengeType":5,"title":"Self-referential sequence","order":3,"superBlock":"coding-interview-prep","dashedName":"self-referential-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/semiprime","blockName":"Rosetta Code"},"id":"5eb3e4aa847216613aa81983","block":"rosetta-code","challengeType":5,"title":"Semiprime","order":3,"superBlock":"coding-interview-prep","dashedName":"semiprime"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/set-consolidation","blockName":"Rosetta Code"},"id":"5eb3e4af7d0e7b760b46cedc","block":"rosetta-code","challengeType":5,"title":"Set consolidation","order":3,"superBlock":"coding-interview-prep","dashedName":"set-consolidation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/set-of-real-numbers","blockName":"Rosetta Code"},"id":"5eb3e4b20aa93c437f9e9717","block":"rosetta-code","challengeType":5,"title":"Set of real numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"set-of-real-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sha-1","blockName":"Rosetta Code"},"id":"5eb3e4b5f629b9a07429a5d2","block":"rosetta-code","challengeType":5,"title":"SHA-1","order":3,"superBlock":"coding-interview-prep","dashedName":"sha-1"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sha-256","blockName":"Rosetta Code"},"id":"5eb3e4c3a894c333d2811a3f","block":"rosetta-code","challengeType":5,"title":"SHA-256","order":3,"superBlock":"coding-interview-prep","dashedName":"sha-256"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc7ffe","block":"rosetta-code","challengeType":5,"title":"Sort an array of composite structures","order":3,"superBlock":"coding-interview-prep","dashedName":"sort-an-array-of-composite-structures"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sort-disjoint-sublist","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8000","block":"rosetta-code","challengeType":5,"title":"Sort disjoint sublist","order":3,"superBlock":"coding-interview-prep","dashedName":"sort-disjoint-sublist"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sort-stability","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8014","block":"rosetta-code","challengeType":5,"title":"Sort stability","order":3,"superBlock":"coding-interview-prep","dashedName":"sort-stability"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sort-using-a-custom-comparator","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8016","block":"rosetta-code","challengeType":5,"title":"Sort using a custom comparator","order":3,"superBlock":"coding-interview-prep","dashedName":"sort-using-a-custom-comparator"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmsbead-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8001","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Bead sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmsbead-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmsbogosort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8002","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Bogosort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmsbogosort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmscocktail-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8004","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Cocktail sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmscocktail-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmscomb-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8005","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Comb sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmscomb-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmsgnome-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8007","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Gnome sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmsgnome-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmspancake-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc800b","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Pancake sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmspancake-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmspermutation-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc800c","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Permutation sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmspermutation-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmsshell-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8010","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Shell sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmsshell-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmsstooge-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8012","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Stooge sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmsstooge-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sorting-algorithmsstrand-sort","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8013","block":"rosetta-code","challengeType":5,"title":"Sorting algorithms/Strand sort","order":3,"superBlock":"coding-interview-prep","dashedName":"sorting-algorithmsstrand-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/soundex","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8017","block":"rosetta-code","challengeType":5,"title":"Soundex","order":3,"superBlock":"coding-interview-prep","dashedName":"soundex"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/spiral-matrix","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc801c","block":"rosetta-code","challengeType":5,"title":"Spiral matrix","order":3,"superBlock":"coding-interview-prep","dashedName":"spiral-matrix"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc801d","block":"rosetta-code","challengeType":5,"title":"Split a character string based on change of character","order":3,"superBlock":"coding-interview-prep","dashedName":"split-a-character-string-based-on-change-of-character"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/state-name-puzzle","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8024","block":"rosetta-code","challengeType":5,"title":"State name puzzle","order":3,"superBlock":"coding-interview-prep","dashedName":"state-name-puzzle"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/stern-brocot-sequence","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8028","block":"rosetta-code","challengeType":5,"title":"Stern-Brocot sequence","order":3,"superBlock":"coding-interview-prep","dashedName":"stern-brocot-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/straddling-checkerboard","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8029","block":"rosetta-code","challengeType":5,"title":"Straddling checkerboard","order":3,"superBlock":"coding-interview-prep","dashedName":"straddling-checkerboard"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/stream-merge","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc802a","block":"rosetta-code","challengeType":5,"title":"Stream Merge","order":3,"superBlock":"coding-interview-prep","dashedName":"stream-merge"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8036","block":"rosetta-code","challengeType":5,"title":"Strip control codes and extended characters from a string","order":3,"superBlock":"coding-interview-prep","dashedName":"strip-control-codes-and-extended-characters-from-a-string"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/subleq","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8038","block":"rosetta-code","challengeType":5,"title":"Subleq","order":3,"superBlock":"coding-interview-prep","dashedName":"subleq"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sudoku","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc803c","block":"rosetta-code","challengeType":5,"title":"Sudoku","order":3,"superBlock":"coding-interview-prep","dashedName":"sudoku"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sum-digits-of-an-integer","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc803f","block":"rosetta-code","challengeType":5,"title":"Sum digits of an integer","order":3,"superBlock":"coding-interview-prep","dashedName":"sum-digits-of-an-integer"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8040","block":"rosetta-code","challengeType":5,"title":"Sum multiples of 3 and 5","order":3,"superBlock":"coding-interview-prep","dashedName":"sum-multiples-of-3-and-5"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sum-of-a-series","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8041","block":"rosetta-code","challengeType":5,"title":"Sum of a series","order":3,"superBlock":"coding-interview-prep","dashedName":"sum-of-a-series"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sum-of-squares","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8042","block":"rosetta-code","challengeType":5,"title":"Sum of squares","order":3,"superBlock":"coding-interview-prep","dashedName":"sum-of-squares"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sum-to-100","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8043","block":"rosetta-code","challengeType":5,"title":"Sum to 100","order":3,"superBlock":"coding-interview-prep","dashedName":"sum-to-100"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8045","block":"rosetta-code","challengeType":5,"title":"Sutherland-Hodgman polygon clipping","order":3,"superBlock":"coding-interview-prep","dashedName":"sutherland-hodgman-polygon-clipping"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/symmetric-difference","blockName":"Rosetta Code"},"id":"5a23c84252665b21eecc8046","block":"rosetta-code","challengeType":5,"title":"Symmetric difference","order":3,"superBlock":"coding-interview-prep","dashedName":"symmetric-difference"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/taxicab-numbers","blockName":"Rosetta Code"},"id":"594ecc0d9a8cf816e3340187","block":"rosetta-code","challengeType":5,"title":"Taxicab numbers","order":3,"superBlock":"coding-interview-prep","dashedName":"taxicab-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping","blockName":"Rosetta Code"},"id":"594faaab4e2a8626833e9c3d","block":"rosetta-code","challengeType":5,"title":"Tokenize a string with escaping","order":3,"superBlock":"coding-interview-prep","dashedName":"tokenize-a-string-with-escaping"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/topological-sort","blockName":"Rosetta Code"},"id":"594fa2746886f41f7d8bf225","block":"rosetta-code","challengeType":5,"title":"Topological sort","order":3,"superBlock":"coding-interview-prep","dashedName":"topological-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/top-rank-per-group","blockName":"Rosetta Code"},"id":"595011cba5a81735713873bd","block":"rosetta-code","challengeType":5,"title":"Top rank per group","order":3,"superBlock":"coding-interview-prep","dashedName":"top-rank-per-group"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/towers-of-hanoi","blockName":"Rosetta Code"},"id":"5951ed8945deab770972ae56","block":"rosetta-code","challengeType":5,"title":"Towers of Hanoi","order":3,"superBlock":"coding-interview-prep","dashedName":"towers-of-hanoi"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/vector-cross-product","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad2","block":"rosetta-code","challengeType":5,"title":"Vector cross product","order":3,"superBlock":"coding-interview-prep","dashedName":"vector-cross-product"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/vector-dot-product","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad3","block":"rosetta-code","challengeType":5,"title":"Vector dot product","order":3,"superBlock":"coding-interview-prep","dashedName":"vector-dot-product"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/word-frequency","blockName":"Rosetta Code"},"id":"5e94a54cc7b022105bf0fd2c","block":"rosetta-code","challengeType":5,"title":"Word frequency","order":3,"superBlock":"coding-interview-prep","dashedName":"word-frequency"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/word-wrap","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad4","block":"rosetta-code","challengeType":5,"title":"Word wrap","order":3,"superBlock":"coding-interview-prep","dashedName":"word-wrap"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/y-combinator","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad5","block":"rosetta-code","challengeType":5,"title":"Y combinator","order":3,"superBlock":"coding-interview-prep","dashedName":"y-combinator"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/zeckendorf-number-representation","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad6","block":"rosetta-code","challengeType":5,"title":"Zeckendorf number representation","order":3,"superBlock":"coding-interview-prep","dashedName":"zeckendorf-number-representation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad7","block":"rosetta-code","challengeType":5,"title":"Zhang-Suen thinning algorithm","order":3,"superBlock":"coding-interview-prep","dashedName":"zhang-suen-thinning-algorithm"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/rosetta-code/zig-zag-matrix","blockName":"Rosetta Code"},"id":"594810f028c0303b75339ad8","block":"rosetta-code","challengeType":5,"title":"Zig-zag matrix","order":3,"superBlock":"coding-interview-prep","dashedName":"zig-zag-matrix"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5","blockName":"Project Euler"},"id":"5900f36e1000cf542c50fe80","block":"project-euler","challengeType":5,"title":"Problem 1: Multiples of 3 and 5","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-1-multiples-of-3-and-5"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers","blockName":"Project Euler"},"id":"5900f36e1000cf542c50fe81","block":"project-euler","challengeType":5,"title":"Problem 2: Even Fibonacci Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-2-even-fibonacci-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-3-largest-prime-factor","blockName":"Project Euler"},"id":"5900f36f1000cf542c50fe82","block":"project-euler","challengeType":5,"title":"Problem 3: Largest prime factor","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-3-largest-prime-factor"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-4-largest-palindrome-product","blockName":"Project Euler"},"id":"5900f3701000cf542c50fe83","block":"project-euler","challengeType":5,"title":"Problem 4: Largest palindrome product","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-4-largest-palindrome-product"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-5-smallest-multiple","blockName":"Project Euler"},"id":"5900f3711000cf542c50fe84","block":"project-euler","challengeType":5,"title":"Problem 5: Smallest multiple","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-5-smallest-multiple"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-6-sum-square-difference","blockName":"Project Euler"},"id":"5900f3721000cf542c50fe85","block":"project-euler","challengeType":5,"title":"Problem 6: Sum square difference","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-6-sum-square-difference"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-7-10001st-prime","blockName":"Project Euler"},"id":"5900f3731000cf542c50fe86","block":"project-euler","challengeType":5,"title":"Problem 7: 10001st prime","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-7-10001st-prime"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-8-largest-product-in-a-series","blockName":"Project Euler"},"id":"5900f3741000cf542c50fe87","block":"project-euler","challengeType":5,"title":"Problem 8: Largest product in a series","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-8-largest-product-in-a-series"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet","blockName":"Project Euler"},"id":"5900f3761000cf542c50fe88","block":"project-euler","challengeType":5,"title":"Problem 9: Special Pythagorean triplet","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-9-special-pythagorean-triplet"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-10-summation-of-primes","blockName":"Project Euler"},"id":"5900f3761000cf542c50fe89","block":"project-euler","challengeType":5,"title":"Problem 10: Summation of primes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-10-summation-of-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid","blockName":"Project Euler"},"id":"5900f3781000cf542c50fe8a","block":"project-euler","challengeType":5,"title":"Problem 11: Largest product in a grid","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-11-largest-product-in-a-grid"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number","blockName":"Project Euler"},"id":"5900f3781000cf542c50fe8b","block":"project-euler","challengeType":5,"title":"Problem 12: Highly divisible triangular number","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-12-highly-divisible-triangular-number"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-13-large-sum","blockName":"Project Euler"},"id":"5900f37a1000cf542c50fe8c","block":"project-euler","challengeType":5,"title":"Problem 13: Large sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-13-large-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-14-longest-collatz-sequence","blockName":"Project Euler"},"id":"5900f37a1000cf542c50fe8d","block":"project-euler","challengeType":5,"title":"Problem 14: Longest Collatz sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-14-longest-collatz-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-15-lattice-paths","blockName":"Project Euler"},"id":"5900f37b1000cf542c50fe8e","block":"project-euler","challengeType":5,"title":"Problem 15: Lattice paths","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-15-lattice-paths"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-16-power-digit-sum","blockName":"Project Euler"},"id":"5900f37d1000cf542c50fe8f","block":"project-euler","challengeType":5,"title":"Problem 16: Power digit sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-16-power-digit-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-17-number-letter-counts","blockName":"Project Euler"},"id":"5900f37d1000cf542c50fe90","block":"project-euler","challengeType":5,"title":"Problem 17: Number letter counts","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-17-number-letter-counts"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-18-maximum-path-sum-i","blockName":"Project Euler"},"id":"5900f37e1000cf542c50fe91","block":"project-euler","challengeType":5,"title":"Problem 18: Maximum path sum I","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-18-maximum-path-sum-i"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-19-counting-sundays","blockName":"Project Euler"},"id":"5900f37f1000cf542c50fe92","block":"project-euler","challengeType":5,"title":"Problem 19: Counting Sundays","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-19-counting-sundays"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-20-factorial-digit-sum","blockName":"Project Euler"},"id":"5900f3801000cf542c50fe93","block":"project-euler","challengeType":5,"title":"Problem 20: Factorial digit sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-20-factorial-digit-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-21-amicable-numbers","blockName":"Project Euler"},"id":"5900f3811000cf542c50fe94","block":"project-euler","challengeType":5,"title":"Problem 21: Amicable numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-21-amicable-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-22-names-scores","blockName":"Project Euler"},"id":"5a51eabcad78bf416f316e2a","block":"project-euler","challengeType":5,"title":"Problem 22: Names scores","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-22-names-scores"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-23-non-abundant-sums","blockName":"Project Euler"},"id":"5900f3831000cf542c50fe96","block":"project-euler","challengeType":5,"title":"Problem 23: Non-abundant sums","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-23-non-abundant-sums"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-24-lexicographic-permutations","blockName":"Project Euler"},"id":"5900f3841000cf542c50fe97","block":"project-euler","challengeType":5,"title":"Problem 24: Lexicographic permutations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-24-lexicographic-permutations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number","blockName":"Project Euler"},"id":"5900f3851000cf542c50fe98","block":"project-euler","challengeType":5,"title":"Problem 25: 1000-digit Fibonacci number","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-25-1000-digit-fibonacci-number"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-26-reciprocal-cycles","blockName":"Project Euler"},"id":"5900f3861000cf542c50fe99","block":"project-euler","challengeType":5,"title":"Problem 26: Reciprocal cycles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-26-reciprocal-cycles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-27-quadratic-primes","blockName":"Project Euler"},"id":"5900f3871000cf542c50fe9a","block":"project-euler","challengeType":5,"title":"Problem 27: Quadratic primes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-27-quadratic-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-28-number-spiral-diagonals","blockName":"Project Euler"},"id":"5900f3881000cf542c50fe9b","block":"project-euler","challengeType":5,"title":"Problem 28: Number spiral diagonals","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-28-number-spiral-diagonals"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-29-distinct-powers","blockName":"Project Euler"},"id":"5900f3891000cf542c50fe9c","block":"project-euler","challengeType":5,"title":"Problem 29: Distinct powers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-29-distinct-powers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-30-digit-n-powers","blockName":"Project Euler"},"id":"5900f38a1000cf542c50fe9d","block":"project-euler","challengeType":5,"title":"Problem 30: Digit n powers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-30-digit-n-powers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-31-coin-sums","blockName":"Project Euler"},"id":"5900f38b1000cf542c50fe9e","block":"project-euler","challengeType":5,"title":"Problem 31: Coin sums","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-31-coin-sums"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-32-pandigital-products","blockName":"Project Euler"},"id":"5900f38c1000cf542c50fe9f","block":"project-euler","challengeType":5,"title":"Problem 32: Pandigital products","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-32-pandigital-products"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions","blockName":"Project Euler"},"id":"5900f38d1000cf542c50fea0","block":"project-euler","challengeType":5,"title":"Problem 33: Digit cancelling fractions","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-33-digit-cancelling-fractions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-34-digit-factorials","blockName":"Project Euler"},"id":"5900f38e1000cf542c50fea1","block":"project-euler","challengeType":5,"title":"Problem 34: Digit factorials","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-34-digit-factorials"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-35-circular-primes","blockName":"Project Euler"},"id":"5900f38f1000cf542c50fea2","block":"project-euler","challengeType":5,"title":"Problem 35: Circular primes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-35-circular-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-36-double-base-palindromes","blockName":"Project Euler"},"id":"5900f3901000cf542c50fea3","block":"project-euler","challengeType":5,"title":"Problem 36: Double-base palindromes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-36-double-base-palindromes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-37-truncatable-primes","blockName":"Project Euler"},"id":"5900f3911000cf542c50fea4","block":"project-euler","challengeType":5,"title":"Problem 37: Truncatable primes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-37-truncatable-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-38-pandigital-multiples","blockName":"Project Euler"},"id":"5900f3931000cf542c50fea5","block":"project-euler","challengeType":5,"title":"Problem 38: Pandigital multiples","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-38-pandigital-multiples"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-39-integer-right-triangles","blockName":"Project Euler"},"id":"5900f3931000cf542c50fea6","block":"project-euler","challengeType":5,"title":"Problem 39: Integer right triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-39-integer-right-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-40-champernownes-constant","blockName":"Project Euler"},"id":"5900f3941000cf542c50fea7","block":"project-euler","challengeType":5,"title":"Problem 40: Champernowne's constant","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-40-champernownes-constant"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-41-pandigital-prime","blockName":"Project Euler"},"id":"5900f3951000cf542c50fea8","block":"project-euler","challengeType":5,"title":"Problem 41: Pandigital prime","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-41-pandigital-prime"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-42-coded-triangle-numbers","blockName":"Project Euler"},"id":"5900f3961000cf542c50fea9","block":"project-euler","challengeType":5,"title":"Problem 42: Coded triangle numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-42-coded-triangle-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-43-sub-string-divisibility","blockName":"Project Euler"},"id":"5900f3971000cf542c50feaa","block":"project-euler","challengeType":5,"title":"Problem 43: Sub-string divisibility","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-43-sub-string-divisibility"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-44-pentagon-numbers","blockName":"Project Euler"},"id":"5900f3981000cf542c50feab","block":"project-euler","challengeType":5,"title":"Problem 44: Pentagon numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-44-pentagon-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal","blockName":"Project Euler"},"id":"5900f3991000cf542c50feac","block":"project-euler","challengeType":5,"title":"Problem 45: Triangular, pentagonal, and hexagonal","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-45-triangular-pentagonal-and-hexagonal"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture","blockName":"Project Euler"},"id":"5900f39a1000cf542c50fead","block":"project-euler","challengeType":5,"title":"Problem 46: Goldbach's other conjecture","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-46-goldbachs-other-conjecture"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-47-distinct-primes-factors","blockName":"Project Euler"},"id":"5900f39c1000cf542c50feae","block":"project-euler","challengeType":5,"title":"Problem 47: Distinct primes factors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-47-distinct-primes-factors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-48-self-powers","blockName":"Project Euler"},"id":"5900f39c1000cf542c50feaf","block":"project-euler","challengeType":5,"title":"Problem 48: Self powers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-48-self-powers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-49-prime-permutations","blockName":"Project Euler"},"id":"5900f39d1000cf542c50feb0","block":"project-euler","challengeType":5,"title":"Problem 49: Prime permutations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-49-prime-permutations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-50-consecutive-prime-sum","blockName":"Project Euler"},"id":"5900f39e1000cf542c50feb1","block":"project-euler","challengeType":5,"title":"Problem 50: Consecutive prime sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-50-consecutive-prime-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-51-prime-digit-replacements","blockName":"Project Euler"},"id":"5900f39f1000cf542c50feb2","block":"project-euler","challengeType":5,"title":"Problem 51: Prime digit replacements","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-51-prime-digit-replacements"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-52-permuted-multiples","blockName":"Project Euler"},"id":"5900f3a01000cf542c50feb3","block":"project-euler","challengeType":5,"title":"Problem 52: Permuted multiples","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-52-permuted-multiples"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-53-combinatoric-selections","blockName":"Project Euler"},"id":"5900f3a11000cf542c50feb4","block":"project-euler","challengeType":5,"title":"Problem 53: Combinatoric selections","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-53-combinatoric-selections"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-54-poker-hands","blockName":"Project Euler"},"id":"5900f3a21000cf542c50feb5","block":"project-euler","challengeType":5,"title":"Problem 54: Poker hands","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-54-poker-hands"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-55-lychrel-numbers","blockName":"Project Euler"},"id":"5900f3a31000cf542c50feb6","block":"project-euler","challengeType":5,"title":"Problem 55: Lychrel numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-55-lychrel-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-56-powerful-digit-sum","blockName":"Project Euler"},"id":"5900f3a41000cf542c50feb7","block":"project-euler","challengeType":5,"title":"Problem 56: Powerful digit sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-56-powerful-digit-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-57-square-root-convergents","blockName":"Project Euler"},"id":"5900f3a51000cf542c50feb8","block":"project-euler","challengeType":5,"title":"Problem 57: Square root convergents","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-57-square-root-convergents"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-58-spiral-primes","blockName":"Project Euler"},"id":"5900f3a61000cf542c50feb9","block":"project-euler","challengeType":5,"title":"Problem 58: Spiral primes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-58-spiral-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-59-xor-decryption","blockName":"Project Euler"},"id":"5900f3a81000cf542c50feba","block":"project-euler","challengeType":5,"title":"Problem 59: XOR decryption","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-59-xor-decryption"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-60-prime-pair-sets","blockName":"Project Euler"},"id":"5900f3a81000cf542c50febb","block":"project-euler","challengeType":5,"title":"Problem 60: Prime pair sets","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-60-prime-pair-sets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers","blockName":"Project Euler"},"id":"5900f3a91000cf542c50febc","block":"project-euler","challengeType":5,"title":"Problem 61: Cyclical figurate numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-61-cyclical-figurate-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-62-cubic-permutations","blockName":"Project Euler"},"id":"5900f3aa1000cf542c50febd","block":"project-euler","challengeType":5,"title":"Problem 62: Cubic permutations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-62-cubic-permutations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-63-powerful-digit-counts","blockName":"Project Euler"},"id":"5900f3ab1000cf542c50febe","block":"project-euler","challengeType":5,"title":"Problem 63: Powerful digit counts","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-63-powerful-digit-counts"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-64-odd-period-square-roots","blockName":"Project Euler"},"id":"5900f3ac1000cf542c50febf","block":"project-euler","challengeType":5,"title":"Problem 64: Odd period square roots","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-64-odd-period-square-roots"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-65-convergents-of-e","blockName":"Project Euler"},"id":"5900f3ad1000cf542c50fec0","block":"project-euler","challengeType":5,"title":"Problem 65: Convergents of e","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-65-convergents-of-e"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-66-diophantine-equation","blockName":"Project Euler"},"id":"5900f3ae1000cf542c50fec1","block":"project-euler","challengeType":5,"title":"Problem 66: Diophantine equation","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-66-diophantine-equation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii","blockName":"Project Euler"},"id":"5900f3b01000cf542c50fec2","block":"project-euler","challengeType":5,"title":"Problem 67: Maximum path sum II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-67-maximum-path-sum-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-68-magic-5-gon-ring","blockName":"Project Euler"},"id":"5900f3b01000cf542c50fec3","block":"project-euler","challengeType":5,"title":"Problem 68: Magic 5-gon ring","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-68-magic-5-gon-ring"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-69-totient-maximum","blockName":"Project Euler"},"id":"5900f3b11000cf542c50fec4","block":"project-euler","challengeType":5,"title":"Problem 69: Totient maximum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-69-totient-maximum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-70-totient-permutation","blockName":"Project Euler"},"id":"5900f3b21000cf542c50fec5","block":"project-euler","challengeType":5,"title":"Problem 70: Totient permutation","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-70-totient-permutation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-71-ordered-fractions","blockName":"Project Euler"},"id":"5900f3b31000cf542c50fec6","block":"project-euler","challengeType":5,"title":"Problem 71: Ordered fractions","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-71-ordered-fractions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-72-counting-fractions","blockName":"Project Euler"},"id":"5900f3b41000cf542c50fec7","block":"project-euler","challengeType":5,"title":"Problem 72: Counting fractions","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-72-counting-fractions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range","blockName":"Project Euler"},"id":"5900f3b61000cf542c50fec8","block":"project-euler","challengeType":5,"title":"Problem 73: Counting fractions in a range","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-73-counting-fractions-in-a-range"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-74-digit-factorial-chains","blockName":"Project Euler"},"id":"5900f3b61000cf542c50fec9","block":"project-euler","challengeType":5,"title":"Problem 74: Digit factorial chains","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-74-digit-factorial-chains"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles","blockName":"Project Euler"},"id":"5900f3b71000cf542c50feca","block":"project-euler","challengeType":5,"title":"Problem 75: Singular integer right triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-75-singular-integer-right-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-76-counting-summations","blockName":"Project Euler"},"id":"5900f3b81000cf542c50fecb","block":"project-euler","challengeType":5,"title":"Problem 76: Counting summations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-76-counting-summations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-77-prime-summations","blockName":"Project Euler"},"id":"5900f3b91000cf542c50fecc","block":"project-euler","challengeType":5,"title":"Problem 77: Prime summations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-77-prime-summations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-78-coin-partitions","blockName":"Project Euler"},"id":"5900f3ba1000cf542c50fecd","block":"project-euler","challengeType":5,"title":"Problem 78: Coin partitions","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-78-coin-partitions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-79-passcode-derivation","blockName":"Project Euler"},"id":"5900f3bb1000cf542c50fece","block":"project-euler","challengeType":5,"title":"Problem 79: Passcode derivation","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-79-passcode-derivation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-80-square-root-digital-expansion","blockName":"Project Euler"},"id":"5900f3bc1000cf542c50fecf","block":"project-euler","challengeType":5,"title":"Problem 80: Square root digital expansion","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-80-square-root-digital-expansion"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-81-path-sum-two-ways","blockName":"Project Euler"},"id":"5900f3bd1000cf542c50fed0","block":"project-euler","challengeType":5,"title":"Problem 81: Path sum: two ways","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-81-path-sum-two-ways"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-82-path-sum-three-ways","blockName":"Project Euler"},"id":"5900f3be1000cf542c50fed1","block":"project-euler","challengeType":5,"title":"Problem 82: Path sum: three ways","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-82-path-sum-three-ways"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-83-path-sum-four-ways","blockName":"Project Euler"},"id":"5900f3bf1000cf542c50fed2","block":"project-euler","challengeType":5,"title":"Problem 83: Path sum: four ways","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-83-path-sum-four-ways"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-84-monopoly-odds","blockName":"Project Euler"},"id":"5900f3c11000cf542c50fed3","block":"project-euler","challengeType":5,"title":"Problem 84: Monopoly odds","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-84-monopoly-odds"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-85-counting-rectangles","blockName":"Project Euler"},"id":"5900f3c11000cf542c50fed4","block":"project-euler","challengeType":5,"title":"Problem 85: Counting rectangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-85-counting-rectangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-86-cuboid-route","blockName":"Project Euler"},"id":"5900f3c31000cf542c50fed5","block":"project-euler","challengeType":5,"title":"Problem 86: Cuboid route","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-86-cuboid-route"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-87-prime-power-triples","blockName":"Project Euler"},"id":"5900f3c51000cf542c50fed8","block":"project-euler","challengeType":5,"title":"Problem 87: Prime power triples","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-87-prime-power-triples"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-88-product-sum-numbers","blockName":"Project Euler"},"id":"5900f3c51000cf542c50fed6","block":"project-euler","challengeType":5,"title":"Problem 88: Product-sum numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-88-product-sum-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-89-roman-numerals","blockName":"Project Euler"},"id":"5900f3c51000cf542c50fed7","block":"project-euler","challengeType":5,"title":"Problem 89: Roman numerals","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-89-roman-numerals"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-90-cube-digit-pairs","blockName":"Project Euler"},"id":"5900f3c61000cf542c50fed9","block":"project-euler","challengeType":5,"title":"Problem 90: Cube digit pairs","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-90-cube-digit-pairs"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates","blockName":"Project Euler"},"id":"5900f3c71000cf542c50feda","block":"project-euler","challengeType":5,"title":"Problem 91: Right triangles with integer coordinates","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-91-right-triangles-with-integer-coordinates"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-92-square-digit-chains","blockName":"Project Euler"},"id":"5900f3c81000cf542c50fedb","block":"project-euler","challengeType":5,"title":"Problem 92: Square digit chains","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-92-square-digit-chains"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-93-arithmetic-expressions","blockName":"Project Euler"},"id":"5900f3ca1000cf542c50fedc","block":"project-euler","challengeType":5,"title":"Problem 93: Arithmetic expressions","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-93-arithmetic-expressions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles","blockName":"Project Euler"},"id":"5900f3ca1000cf542c50fedd","block":"project-euler","challengeType":5,"title":"Problem 94: Almost equilateral triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-94-almost-equilateral-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-95-amicable-chains","blockName":"Project Euler"},"id":"5900f3cc1000cf542c50fede","block":"project-euler","challengeType":5,"title":"Problem 95: Amicable chains","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-95-amicable-chains"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-96-su-doku","blockName":"Project Euler"},"id":"5900f3cc1000cf542c50fedf","block":"project-euler","challengeType":5,"title":"Problem 96: Su Doku","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-96-su-doku"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime","blockName":"Project Euler"},"id":"5900f3ce1000cf542c50fee0","block":"project-euler","challengeType":5,"title":"Problem 97: Large non-Mersenne prime","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-97-large-non-mersenne-prime"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-98-anagramic-squares","blockName":"Project Euler"},"id":"5900f3cf1000cf542c50fee1","block":"project-euler","challengeType":5,"title":"Problem 98: Anagramic squares","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-98-anagramic-squares"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-99-largest-exponential","blockName":"Project Euler"},"id":"5900f3d01000cf542c50fee2","block":"project-euler","challengeType":5,"title":"Problem 99: Largest exponential","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-99-largest-exponential"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-100-arranged-probability","blockName":"Project Euler"},"id":"5900f3d01000cf542c50fee3","block":"project-euler","challengeType":5,"title":"Problem 100: Arranged probability","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-100-arranged-probability"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-101-optimum-polynomial","blockName":"Project Euler"},"id":"5900f3d21000cf542c50fee4","block":"project-euler","challengeType":5,"title":"Problem 101: Optimum polynomial","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-101-optimum-polynomial"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-102-triangle-containment","blockName":"Project Euler"},"id":"5900f3d21000cf542c50fee5","block":"project-euler","challengeType":5,"title":"Problem 102: Triangle containment","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-102-triangle-containment"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum","blockName":"Project Euler"},"id":"5900f3d61000cf542c50fee7","block":"project-euler","challengeType":5,"title":"Problem 103: Special subset sums: optimum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-103-special-subset-sums-optimum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends","blockName":"Project Euler"},"id":"5900f3d51000cf542c50fee6","block":"project-euler","challengeType":5,"title":"Problem 104: Pandigital Fibonacci ends","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-104-pandigital-fibonacci-ends"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-105-special-subset-sums-testing","blockName":"Project Euler"},"id":"5900f3d61000cf542c50fee8","block":"project-euler","challengeType":5,"title":"Problem 105: Special subset sums: testing","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-105-special-subset-sums-testing"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing","blockName":"Project Euler"},"id":"5900f3d71000cf542c50fee9","block":"project-euler","challengeType":5,"title":"Problem 106: Special subset sums: meta-testing","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-106-special-subset-sums-meta-testing"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-107-minimal-network","blockName":"Project Euler"},"id":"5900f3d91000cf542c50feea","block":"project-euler","challengeType":5,"title":"Problem 107: Minimal network","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-107-minimal-network"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i","blockName":"Project Euler"},"id":"5900f3d91000cf542c50feeb","block":"project-euler","challengeType":5,"title":"Problem 108: Diophantine Reciprocals I","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-108-diophantine-reciprocals-i"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-109-darts","blockName":"Project Euler"},"id":"5900f3db1000cf542c50feec","block":"project-euler","challengeType":5,"title":"Problem 109: Darts","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-109-darts"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii","blockName":"Project Euler"},"id":"5900f3db1000cf542c50feed","block":"project-euler","challengeType":5,"title":"Problem 110: Diophantine Reciprocals II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-110-diophantine-reciprocals-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-111-primes-with-runs","blockName":"Project Euler"},"id":"5900f3db1000cf542c50feee","block":"project-euler","challengeType":5,"title":"Problem 111: Primes with runs","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-111-primes-with-runs"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-112-bouncy-numbers","blockName":"Project Euler"},"id":"5900f3dd1000cf542c50feef","block":"project-euler","challengeType":5,"title":"Problem 112: Bouncy numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-112-bouncy-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-113-non-bouncy-numbers","blockName":"Project Euler"},"id":"5900f3dd1000cf542c50fef0","block":"project-euler","challengeType":5,"title":"Problem 113: Non-bouncy numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-113-non-bouncy-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-114-counting-block-combinations-i","blockName":"Project Euler"},"id":"5900f3e01000cf542c50fef2","block":"project-euler","challengeType":5,"title":"Problem 114: Counting block combinations I","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-114-counting-block-combinations-i"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii","blockName":"Project Euler"},"id":"5900f3df1000cf542c50fef1","block":"project-euler","challengeType":5,"title":"Problem 115: Counting block combinations II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-115-counting-block-combinations-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles","blockName":"Project Euler"},"id":"5900f3e01000cf542c50fef3","block":"project-euler","challengeType":5,"title":"Problem 116: Red, green or blue tiles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-116-red-green-or-blue-tiles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles","blockName":"Project Euler"},"id":"5900f3e21000cf542c50fef4","block":"project-euler","challengeType":5,"title":"Problem 117: Red, green, and blue tiles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-117-red-green-and-blue-tiles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-118-pandigital-prime-sets","blockName":"Project Euler"},"id":"5900f3e21000cf542c50fef5","block":"project-euler","challengeType":5,"title":"Problem 118: Pandigital prime sets","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-118-pandigital-prime-sets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-119-digit-power-sum","blockName":"Project Euler"},"id":"5900f3e41000cf542c50fef6","block":"project-euler","challengeType":5,"title":"Problem 119: Digit power sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-119-digit-power-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-120-square-remainders","blockName":"Project Euler"},"id":"5900f3e41000cf542c50fef7","block":"project-euler","challengeType":5,"title":"Problem 120: Square remainders","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-120-square-remainders"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-121-disc-game-prize-fund","blockName":"Project Euler"},"id":"5900f3e51000cf542c50fef8","block":"project-euler","challengeType":5,"title":"Problem 121: Disc game prize fund","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-121-disc-game-prize-fund"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-122-efficient-exponentiation","blockName":"Project Euler"},"id":"5900f3e61000cf542c50fef9","block":"project-euler","challengeType":5,"title":"Problem 122: Efficient exponentiation","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-122-efficient-exponentiation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-123-prime-square-remainders","blockName":"Project Euler"},"id":"5900f3e71000cf542c50fefa","block":"project-euler","challengeType":5,"title":"Problem 123: Prime square remainders","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-123-prime-square-remainders"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-124-ordered-radicals","blockName":"Project Euler"},"id":"5900f3e81000cf542c50fefb","block":"project-euler","challengeType":5,"title":"Problem 124: Ordered radicals","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-124-ordered-radicals"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-125-palindromic-sums","blockName":"Project Euler"},"id":"5900f3e91000cf542c50fefc","block":"project-euler","challengeType":5,"title":"Problem 125: Palindromic sums","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-125-palindromic-sums"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-126-cuboid-layers","blockName":"Project Euler"},"id":"5900f3ea1000cf542c50fefd","block":"project-euler","challengeType":5,"title":"Problem 126: Cuboid layers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-126-cuboid-layers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-127-abc-hits","blockName":"Project Euler"},"id":"5900f3ec1000cf542c50fefe","block":"project-euler","challengeType":5,"title":"Problem 127: abc-hits","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-127-abc-hits"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences","blockName":"Project Euler"},"id":"5900f3ec1000cf542c50feff","block":"project-euler","challengeType":5,"title":"Problem 128: Hexagonal tile differences","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-128-hexagonal-tile-differences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-129-repunit-divisibility","blockName":"Project Euler"},"id":"5900f3ef1000cf542c50ff01","block":"project-euler","challengeType":5,"title":"Problem 129: Repunit divisibility","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-129-repunit-divisibility"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property","blockName":"Project Euler"},"id":"5900f3ee1000cf542c50ff00","block":"project-euler","challengeType":5,"title":"Problem 130: Composites with prime repunit property","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-130-composites-with-prime-repunit-property"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-131-prime-cube-partnership","blockName":"Project Euler"},"id":"5900f3ef1000cf542c50ff02","block":"project-euler","challengeType":5,"title":"Problem 131: Prime cube partnership","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-131-prime-cube-partnership"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-132-large-repunit-factors","blockName":"Project Euler"},"id":"5900f3f11000cf542c50ff03","block":"project-euler","challengeType":5,"title":"Problem 132: Large repunit factors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-132-large-repunit-factors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-133-repunit-nonfactors","blockName":"Project Euler"},"id":"5900f3f21000cf542c50ff04","block":"project-euler","challengeType":5,"title":"Problem 133: Repunit nonfactors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-133-repunit-nonfactors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-134-prime-pair-connection","blockName":"Project Euler"},"id":"5900f3f21000cf542c50ff05","block":"project-euler","challengeType":5,"title":"Problem 134: Prime pair connection","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-134-prime-pair-connection"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-135-same-differences","blockName":"Project Euler"},"id":"5900f3f31000cf542c50ff06","block":"project-euler","challengeType":5,"title":"Problem 135: Same differences","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-135-same-differences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-136-singleton-difference","blockName":"Project Euler"},"id":"5900f3f51000cf542c50ff07","block":"project-euler","challengeType":5,"title":"Problem 136: Singleton difference","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-136-singleton-difference"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets","blockName":"Project Euler"},"id":"5900f3f51000cf542c50ff08","block":"project-euler","challengeType":5,"title":"Problem 137: Fibonacci golden nuggets","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-137-fibonacci-golden-nuggets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-138-special-isosceles-triangles","blockName":"Project Euler"},"id":"5900f3f61000cf542c50ff09","block":"project-euler","challengeType":5,"title":"Problem 138: Special isosceles triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-138-special-isosceles-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-139-pythagorean-tiles","blockName":"Project Euler"},"id":"5900f3f71000cf542c50ff0a","block":"project-euler","challengeType":5,"title":"Problem 139: Pythagorean tiles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-139-pythagorean-tiles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets","blockName":"Project Euler"},"id":"5900f3fa1000cf542c50ff0c","block":"project-euler","challengeType":5,"title":"Problem 140: Modified Fibonacci golden nuggets","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-140-modified-fibonacci-golden-nuggets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square","blockName":"Project Euler"},"id":"5900f3f91000cf542c50ff0b","block":"project-euler","challengeType":5,"title":"Problem 141: Investigating progressive numbers, n, which are also square","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-141-investigating-progressive-numbers-n-which-are-also-square"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-142-perfect-square-collection","blockName":"Project Euler"},"id":"5900f3fa1000cf542c50ff0d","block":"project-euler","challengeType":5,"title":"Problem 142: Perfect Square Collection","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-142-perfect-square-collection"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle","blockName":"Project Euler"},"id":"5900f3fc1000cf542c50ff0e","block":"project-euler","challengeType":5,"title":"Problem 143: Investigating the Torricelli point of a triangle","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-143-investigating-the-torricelli-point-of-a-triangle"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam","blockName":"Project Euler"},"id":"5900f3fc1000cf542c50ff0f","block":"project-euler","challengeType":5,"title":"Problem 144: Investigating multiple reflections of a laser beam","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-144-investigating-multiple-reflections-of-a-laser-beam"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion","blockName":"Project Euler"},"id":"5900f3fd1000cf542c50ff10","block":"project-euler","challengeType":5,"title":"Problem 145: How many reversible numbers are there below one-billion?","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-145-how-many-reversible-numbers-are-there-below-one-billion"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern","blockName":"Project Euler"},"id":"5900f3fe1000cf542c50ff11","block":"project-euler","challengeType":5,"title":"Problem 146: Investigating a Prime Pattern","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-146-investigating-a-prime-pattern"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids","blockName":"Project Euler"},"id":"5900f3ff1000cf542c50ff12","block":"project-euler","challengeType":5,"title":"Problem 147: Rectangles in cross-hatched grids","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-147-rectangles-in-cross-hatched-grids"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle","blockName":"Project Euler"},"id":"5900f4021000cf542c50ff14","block":"project-euler","challengeType":5,"title":"Problem 148: Exploring Pascal's triangle","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-148-exploring-pascals-triangle"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence","blockName":"Project Euler"},"id":"5900f4021000cf542c50ff13","block":"project-euler","challengeType":5,"title":"Problem 149: Searching for a maximum-sum subsequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-149-searching-for-a-maximum-sum-subsequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum","blockName":"Project Euler"},"id":"5900f4031000cf542c50ff15","block":"project-euler","challengeType":5,"title":"Problem 150: Searching a triangular array for a sub-triangle having minimum-sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem","blockName":"Project Euler"},"id":"5900f4031000cf542c50ff16","block":"project-euler","challengeType":5,"title":"Problem 151: Paper sheets of standard sizes: an expected-value problem","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares","blockName":"Project Euler"},"id":"5900f4041000cf542c50ff17","block":"project-euler","challengeType":5,"title":"Problem 152: Writing one half as a sum of inverse squares","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-152-writing-one-half-as-a-sum-of-inverse-squares"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers","blockName":"Project Euler"},"id":"5900f4051000cf542c50ff18","block":"project-euler","challengeType":5,"title":"Problem 153: Investigating Gaussian Integers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-153-investigating-gaussian-integers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid","blockName":"Project Euler"},"id":"5900f4071000cf542c50ff19","block":"project-euler","challengeType":5,"title":"Problem 154: Exploring Pascal's pyramid","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-154-exploring-pascals-pyramid"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits","blockName":"Project Euler"},"id":"5900f4081000cf542c50ff1a","block":"project-euler","challengeType":5,"title":"Problem 155: Counting Capacitor Circuits","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-155-counting-capacitor-circuits"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-156-counting-digits","blockName":"Project Euler"},"id":"5900f4091000cf542c50ff1b","block":"project-euler","challengeType":5,"title":"Problem 156: Counting Digits","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-156-counting-digits"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation","blockName":"Project Euler"},"id":"5900f4091000cf542c50ff1c","block":"project-euler","challengeType":5,"title":"Problem 157: Solving the diophantine equation","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-157-solving-the-diophantine-equation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left","blockName":"Project Euler"},"id":"5900f40a1000cf542c50ff1d","block":"project-euler","challengeType":5,"title":"Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations","blockName":"Project Euler"},"id":"5900f40c1000cf542c50ff1e","block":"project-euler","challengeType":5,"title":"Problem 159: Digital root sums of factorisations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-159-digital-root-sums-of-factorisations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-160-factorial-trailing-digits","blockName":"Project Euler"},"id":"5900f40d1000cf542c50ff1f","block":"project-euler","challengeType":5,"title":"Problem 160: Factorial trailing digits","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-160-factorial-trailing-digits"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-161-triominoes","blockName":"Project Euler"},"id":"5900f40d1000cf542c50ff20","block":"project-euler","challengeType":5,"title":"Problem 161: Triominoes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-161-triominoes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-162-hexadecimal-numbers","blockName":"Project Euler"},"id":"5900f40e1000cf542c50ff21","block":"project-euler","challengeType":5,"title":"Problem 162: Hexadecimal numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-162-hexadecimal-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-163-cross-hatched-triangles","blockName":"Project Euler"},"id":"5900f40f1000cf542c50ff22","block":"project-euler","challengeType":5,"title":"Problem 163: Cross-hatched triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-163-cross-hatched-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value","blockName":"Project Euler"},"id":"5900f4111000cf542c50ff23","block":"project-euler","challengeType":5,"title":"Problem 164: Numbers for which no three consecutive digits have a sum greater than a given value","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-165-intersections","blockName":"Project Euler"},"id":"5900f4111000cf542c50ff24","block":"project-euler","challengeType":5,"title":"Problem 165: Intersections","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-165-intersections"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-166-criss-cross","blockName":"Project Euler"},"id":"5900f4131000cf542c50ff25","block":"project-euler","challengeType":5,"title":"Problem 166: Criss Cross","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-166-criss-cross"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences","blockName":"Project Euler"},"id":"5900f4141000cf542c50ff26","block":"project-euler","challengeType":5,"title":"Problem 167: Investigating Ulam sequences","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-167-investigating-ulam-sequences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-168-number-rotations","blockName":"Project Euler"},"id":"5900f4151000cf542c50ff27","block":"project-euler","challengeType":5,"title":"Problem 168: Number Rotations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-168-number-rotations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2","blockName":"Project Euler"},"id":"5900f4151000cf542c50ff28","block":"project-euler","challengeType":5,"title":"Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products","blockName":"Project Euler"},"id":"5900f4161000cf542c50ff29","block":"project-euler","challengeType":5,"title":"Problem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square","blockName":"Project Euler"},"id":"5900f4181000cf542c50ff2a","block":"project-euler","challengeType":5,"title":"Problem 171: Finding numbers for which the sum of the squares of the digits is a square","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits","blockName":"Project Euler"},"id":"5900f4181000cf542c50ff2b","block":"project-euler","challengeType":5,"title":"Problem 172: Investigating numbers with few repeated digits","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-172-investigating-numbers-with-few-repeated-digits"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed","blockName":"Project Euler"},"id":"5900f41a1000cf542c50ff2c","block":"project-euler","challengeType":5,"title":"Problem 173: Using up to one million tiles how many different \"hollow\" square laminae can be formed?","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-----distinct-arrangements","blockName":"Project Euler"},"id":"5900f41a1000cf542c50ff2d","block":"project-euler","challengeType":5,"title":"Problem 174: Counting the number of \"hollow\" square laminae that can form one, two, three, ... distinct arrangements","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-----distinct-arrangements"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2","blockName":"Project Euler"},"id":"5900f41c1000cf542c50ff2e","block":"project-euler","challengeType":5,"title":"Problem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus","blockName":"Project Euler"},"id":"5900f41c1000cf542c50ff2f","block":"project-euler","challengeType":5,"title":"Problem 176: Right-angled triangles that share a cathetus","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-176-right-angled-triangles-that-share-a-cathetus"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals","blockName":"Project Euler"},"id":"5900f41e1000cf542c50ff30","block":"project-euler","challengeType":5,"title":"Problem 177: Integer angled Quadrilaterals","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-177-integer-angled-quadrilaterals"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-178-step-numbers","blockName":"Project Euler"},"id":"5900f41e1000cf542c50ff31","block":"project-euler","challengeType":5,"title":"Problem 178: Step Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-178-step-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors","blockName":"Project Euler"},"id":"5900f41f1000cf542c50ff32","block":"project-euler","challengeType":5,"title":"Problem 179: Consecutive positive divisors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-179-consecutive-positive-divisors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables","blockName":"Project Euler"},"id":"5900f4201000cf542c50ff33","block":"project-euler","challengeType":5,"title":"Problem 180: Rational zeros of a function of three variables","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-180-rational-zeros-of-a-function-of-three-variables"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped","blockName":"Project Euler"},"id":"5900f4231000cf542c50ff34","block":"project-euler","challengeType":5,"title":"Problem 181: Investigating in how many ways objects of two different colours can be grouped","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-182-rsa-encryption","blockName":"Project Euler"},"id":"5900f4231000cf542c50ff35","block":"project-euler","challengeType":5,"title":"Problem 182: RSA encryption","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-182-rsa-encryption"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-183-maximum-product-of-parts","blockName":"Project Euler"},"id":"5900f4231000cf542c50ff36","block":"project-euler","challengeType":5,"title":"Problem 183: Maximum product of parts","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-183-maximum-product-of-parts"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin","blockName":"Project Euler"},"id":"5900f4241000cf542c50ff37","block":"project-euler","challengeType":5,"title":"Problem 184: Triangles containing the origin","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-184-triangles-containing-the-origin"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-185-number-mind","blockName":"Project Euler"},"id":"5900f4251000cf542c50ff38","block":"project-euler","challengeType":5,"title":"Problem 185: Number Mind","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-185-number-mind"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-186-connectedness-of-a-network","blockName":"Project Euler"},"id":"5900f4281000cf542c50ff39","block":"project-euler","challengeType":5,"title":"Problem 186: Connectedness of a network","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-186-connectedness-of-a-network"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-187-semiprimes","blockName":"Project Euler"},"id":"5900f4291000cf542c50ff3a","block":"project-euler","challengeType":5,"title":"Problem 187: Semiprimes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-187-semiprimes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number","blockName":"Project Euler"},"id":"5900f4291000cf542c50ff3b","block":"project-euler","challengeType":5,"title":"Problem 188: The hyperexponentiation of a number","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-188-the-hyperexponentiation-of-a-number"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid","blockName":"Project Euler"},"id":"5900f4291000cf542c50ff3c","block":"project-euler","challengeType":5,"title":"Problem 189: Tri-colouring a triangular grid","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-189-tri-colouring-a-triangular-grid"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product","blockName":"Project Euler"},"id":"5900f42b1000cf542c50ff3d","block":"project-euler","challengeType":5,"title":"Problem 190: Maximising a weighted product","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-190-maximising-a-weighted-product"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-191-prize-strings","blockName":"Project Euler"},"id":"5900f42b1000cf542c50ff3e","block":"project-euler","challengeType":5,"title":"Problem 191: Prize Strings","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-191-prize-strings"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-192-best-approximations","blockName":"Project Euler"},"id":"5900f42c1000cf542c50ff3f","block":"project-euler","challengeType":5,"title":"Problem 192: Best Approximations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-192-best-approximations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-193-squarefree-numbers","blockName":"Project Euler"},"id":"5900f42f1000cf542c50ff41","block":"project-euler","challengeType":5,"title":"Problem 193: Squarefree Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-193-squarefree-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-194-coloured-configurations","blockName":"Project Euler"},"id":"5900f42f1000cf542c50ff40","block":"project-euler","challengeType":5,"title":"Problem 194: Coloured Configurations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-194-coloured-configurations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees","blockName":"Project Euler"},"id":"5900f4311000cf542c50ff43","block":"project-euler","challengeType":5,"title":"Problem 195: Inscribed circles of triangles with one angle of 60 degrees","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-196-prime-triplets","blockName":"Project Euler"},"id":"5900f4301000cf542c50ff42","block":"project-euler","challengeType":5,"title":"Problem 196: Prime triplets","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-196-prime-triplets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence","blockName":"Project Euler"},"id":"5900f4311000cf542c50ff44","block":"project-euler","challengeType":5,"title":"Problem 197: Investigating the behaviour of a recursively defined sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-198-ambiguous-numbers","blockName":"Project Euler"},"id":"5900f4331000cf542c50ff45","block":"project-euler","challengeType":5,"title":"Problem 198: Ambiguous Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-198-ambiguous-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-199-iterative-circle-packing","blockName":"Project Euler"},"id":"5900f4341000cf542c50ff46","block":"project-euler","challengeType":5,"title":"Problem 199: Iterative Circle Packing","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-199-iterative-circle-packing"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200","blockName":"Project Euler"},"id":"5900f4351000cf542c50ff47","block":"project-euler","challengeType":5,"title":"Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string \"200\"","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum","blockName":"Project Euler"},"id":"5900f4361000cf542c50ff48","block":"project-euler","challengeType":5,"title":"Problem 201: Subsets with a unique sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-201-subsets-with-a-unique-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-202-laserbeam","blockName":"Project Euler"},"id":"5900f4371000cf542c50ff49","block":"project-euler","challengeType":5,"title":"Problem 202: Laserbeam","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-202-laserbeam"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients","blockName":"Project Euler"},"id":"5900f4381000cf542c50ff4a","block":"project-euler","challengeType":5,"title":"Problem 203: Squarefree Binomial Coefficients","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-203-squarefree-binomial-coefficients"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers","blockName":"Project Euler"},"id":"5900f4381000cf542c50ff4b","block":"project-euler","challengeType":5,"title":"Problem 204: Generalised Hamming Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-204-generalised-hamming-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-205-dice-game","blockName":"Project Euler"},"id":"5900f4391000cf542c50ff4c","block":"project-euler","challengeType":5,"title":"Problem 205: Dice Game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-205-dice-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-206-concealed-square","blockName":"Project Euler"},"id":"5900f43a1000cf542c50ff4d","block":"project-euler","challengeType":5,"title":"Problem 206: Concealed Square","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-206-concealed-square"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-207-integer-partition-equations","blockName":"Project Euler"},"id":"5900f43c1000cf542c50ff4e","block":"project-euler","challengeType":5,"title":"Problem 207: Integer partition equations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-207-integer-partition-equations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-208-robot-walks","blockName":"Project Euler"},"id":"5900f43f1000cf542c50ff51","block":"project-euler","challengeType":5,"title":"Problem 208: Robot Walks","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-208-robot-walks"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-209-circular-logic","blockName":"Project Euler"},"id":"5900f43e1000cf542c50ff4f","block":"project-euler","challengeType":5,"title":"Problem 209: Circular Logic","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-209-circular-logic"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles","blockName":"Project Euler"},"id":"5900f43e1000cf542c50ff50","block":"project-euler","challengeType":5,"title":"Problem 210: Obtuse Angled Triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-210-obtuse-angled-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-211-divisor-square-sum","blockName":"Project Euler"},"id":"5900f43f1000cf542c50ff52","block":"project-euler","challengeType":5,"title":"Problem 211: Divisor Square Sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-211-divisor-square-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids","blockName":"Project Euler"},"id":"5900f4411000cf542c50ff53","block":"project-euler","challengeType":5,"title":"Problem 212: Combined Volume of Cuboids","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-212-combined-volume-of-cuboids"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-213-flea-circus","blockName":"Project Euler"},"id":"5900f4411000cf542c50ff54","block":"project-euler","challengeType":5,"title":"Problem 213: Flea Circus","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-213-flea-circus"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-214-totient-chains","blockName":"Project Euler"},"id":"5900f4421000cf542c50ff55","block":"project-euler","challengeType":5,"title":"Problem 214: Totient Chains","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-214-totient-chains"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-215-crack-free-walls","blockName":"Project Euler"},"id":"5900f4431000cf542c50ff56","block":"project-euler","challengeType":5,"title":"Problem 215: Crack-free Walls","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-215-crack-free-walls"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1","blockName":"Project Euler"},"id":"5900f4451000cf542c50ff57","block":"project-euler","challengeType":5,"title":"Problem 216: Investigating the primality of numbers of the form 2n2-1","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-217-balanced-numbers","blockName":"Project Euler"},"id":"5900f4461000cf542c50ff58","block":"project-euler","challengeType":5,"title":"Problem 217: Balanced Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-217-balanced-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles","blockName":"Project Euler"},"id":"5900f4461000cf542c50ff59","block":"project-euler","challengeType":5,"title":"Problem 218: Perfect right-angled triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-218-perfect-right-angled-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-219-skew-cost-coding","blockName":"Project Euler"},"id":"5900f4481000cf542c50ff5a","block":"project-euler","challengeType":5,"title":"Problem 219: Skew-cost coding","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-219-skew-cost-coding"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-220-heighway-dragon","blockName":"Project Euler"},"id":"5900f4481000cf542c50ff5b","block":"project-euler","challengeType":5,"title":"Problem 220: Heighway Dragon","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-220-heighway-dragon"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-221-alexandrian-integers","blockName":"Project Euler"},"id":"5900f4491000cf542c50ff5c","block":"project-euler","challengeType":5,"title":"Problem 221: Alexandrian Integers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-221-alexandrian-integers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-222-sphere-packing","blockName":"Project Euler"},"id":"5900f44b1000cf542c50ff5d","block":"project-euler","challengeType":5,"title":"Problem 222: Sphere Packing","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-222-sphere-packing"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i","blockName":"Project Euler"},"id":"5900f44b1000cf542c50ff5e","block":"project-euler","challengeType":5,"title":"Problem 223: Almost right-angled triangles I","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-223-almost-right-angled-triangles-i"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii","blockName":"Project Euler"},"id":"5900f44e1000cf542c50ff5f","block":"project-euler","challengeType":5,"title":"Problem 224: Almost right-angled triangles II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-224-almost-right-angled-triangles-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors","blockName":"Project Euler"},"id":"5900f44e1000cf542c50ff60","block":"project-euler","challengeType":5,"title":"Problem 225: Tribonacci non-divisors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-225-tribonacci-non-divisors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange","blockName":"Project Euler"},"id":"5900f4511000cf542c50ff62","block":"project-euler","challengeType":5,"title":"Problem 226: A Scoop of Blancmange","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-226-a-scoop-of-blancmange"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-227-the-chase","blockName":"Project Euler"},"id":"5900f44f1000cf542c50ff61","block":"project-euler","challengeType":5,"title":"Problem 227: The Chase","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-227-the-chase"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-228-minkowski-sums","blockName":"Project Euler"},"id":"5900f4511000cf542c50ff63","block":"project-euler","challengeType":5,"title":"Problem 228: Minkowski Sums","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-228-minkowski-sums"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-229-four-representations-using-squares","blockName":"Project Euler"},"id":"5900f4521000cf542c50ff64","block":"project-euler","challengeType":5,"title":"Problem 229: Four Representations using Squares","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-229-four-representations-using-squares"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-230-fibonacci-words","blockName":"Project Euler"},"id":"5900f4531000cf542c50ff65","block":"project-euler","challengeType":5,"title":"Problem 230: Fibonacci Words","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-230-fibonacci-words"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients","blockName":"Project Euler"},"id":"5900f4531000cf542c50ff66","block":"project-euler","challengeType":5,"title":"Problem 231: The prime factorisation of binomial coefficients","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-231-the-prime-factorisation-of-binomial-coefficients"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-232-the-race","blockName":"Project Euler"},"id":"5900f4551000cf542c50ff67","block":"project-euler","challengeType":5,"title":"Problem 232: The Race","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-232-the-race"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle","blockName":"Project Euler"},"id":"5900f4551000cf542c50ff68","block":"project-euler","challengeType":5,"title":"Problem 233: Lattice points on a circle","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-233-lattice-points-on-a-circle"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-234-semidivisible-numbers","blockName":"Project Euler"},"id":"5900f4571000cf542c50ff69","block":"project-euler","challengeType":5,"title":"Problem 234: Semidivisible numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-234-semidivisible-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence","blockName":"Project Euler"},"id":"5900f4571000cf542c50ff6a","block":"project-euler","challengeType":5,"title":"Problem 235: An Arithmetic Geometric sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-235-an-arithmetic-geometric-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-236-luxury-hampers","blockName":"Project Euler"},"id":"5900f4591000cf542c50ff6b","block":"project-euler","challengeType":5,"title":"Problem 236: Luxury Hampers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-236-luxury-hampers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board","blockName":"Project Euler"},"id":"5900f4591000cf542c50ff6c","block":"project-euler","challengeType":5,"title":"Problem 237: Tours on a 4 x n playing board","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-237-tours-on-a-4-x-n-playing-board"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-238-infinite-string-tour","blockName":"Project Euler"},"id":"5900f45b1000cf542c50ff6d","block":"project-euler","challengeType":5,"title":"Problem 238: Infinite string tour","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-238-infinite-string-tour"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes","blockName":"Project Euler"},"id":"5900f45c1000cf542c50ff6e","block":"project-euler","challengeType":5,"title":"Problem 239: Twenty-two Foolish Primes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-239-twenty-two-foolish-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-240-top-dice","blockName":"Project Euler"},"id":"5900f45d1000cf542c50ff6f","block":"project-euler","challengeType":5,"title":"Problem 240: Top Dice","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-240-top-dice"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-241-perfection-quotients","blockName":"Project Euler"},"id":"5900f45d1000cf542c50ff70","block":"project-euler","challengeType":5,"title":"Problem 241: Perfection Quotients","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-241-perfection-quotients"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-242-odd-triplets","blockName":"Project Euler"},"id":"5900f45f1000cf542c50ff71","block":"project-euler","challengeType":5,"title":"Problem 242: Odd Triplets","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-242-odd-triplets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-243-resilience","blockName":"Project Euler"},"id":"5900f4601000cf542c50ff73","block":"project-euler","challengeType":5,"title":"Problem 243: Resilience","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-243-resilience"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-244-sliders","blockName":"Project Euler"},"id":"5900f4601000cf542c50ff72","block":"project-euler","challengeType":5,"title":"Problem 244: Sliders","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-244-sliders"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-245-coresilience","blockName":"Project Euler"},"id":"5900f4621000cf542c50ff74","block":"project-euler","challengeType":5,"title":"Problem 245: Coresilience","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-245-coresilience"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse","blockName":"Project Euler"},"id":"5900f4621000cf542c50ff75","block":"project-euler","challengeType":5,"title":"Problem 246: Tangents to an ellipse","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-246-tangents-to-an-ellipse"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola","blockName":"Project Euler"},"id":"5900f4641000cf542c50ff76","block":"project-euler","challengeType":5,"title":"Problem 247: Squares under a hyperbola","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-247-squares-under-a-hyperbola"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13","blockName":"Project Euler"},"id":"5900f4651000cf542c50ff77","block":"project-euler","challengeType":5,"title":"Problem 248: Numbers for which Euler’s totient function equals 13!","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-248-numbers-for-which-eulers-totient-function-equals-13"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-249-prime-subset-sums","blockName":"Project Euler"},"id":"5900f4671000cf542c50ff79","block":"project-euler","challengeType":5,"title":"Problem 249: Prime Subset Sums","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-249-prime-subset-sums"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-250-250250","blockName":"Project Euler"},"id":"5900f4661000cf542c50ff78","block":"project-euler","challengeType":5,"title":"Problem 250: 250250","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-250-250250"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-251-cardano-triplets","blockName":"Project Euler"},"id":"5900f4671000cf542c50ff7a","block":"project-euler","challengeType":5,"title":"Problem 251: Cardano Triplets","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-251-cardano-triplets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-252-convex-holes","blockName":"Project Euler"},"id":"5900f4691000cf542c50ff7b","block":"project-euler","challengeType":5,"title":"Problem 252: Convex Holes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-252-convex-holes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-253-tidying-up","blockName":"Project Euler"},"id":"5900f4691000cf542c50ff7c","block":"project-euler","challengeType":5,"title":"Problem 253: Tidying up","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-253-tidying-up"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials","blockName":"Project Euler"},"id":"5900f46b1000cf542c50ff7d","block":"project-euler","challengeType":5,"title":"Problem 254: Sums of Digit Factorials","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-254-sums-of-digit-factorials"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-255-rounded-square-roots","blockName":"Project Euler"},"id":"5900f46d1000cf542c50ff7f","block":"project-euler","challengeType":5,"title":"Problem 255: Rounded Square Roots","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-255-rounded-square-roots"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-256-tatami-free-rooms","blockName":"Project Euler"},"id":"5900f46c1000cf542c50ff7e","block":"project-euler","challengeType":5,"title":"Problem 256: Tatami-Free Rooms","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-256-tatami-free-rooms"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-257-angular-bisectors","blockName":"Project Euler"},"id":"5900f46e1000cf542c50ff80","block":"project-euler","challengeType":5,"title":"Problem 257: Angular Bisectors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-257-angular-bisectors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence","blockName":"Project Euler"},"id":"5900f46e1000cf542c50ff81","block":"project-euler","challengeType":5,"title":"Problem 258: A lagged Fibonacci sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-258-a-lagged-fibonacci-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-259-reachable-numbers","blockName":"Project Euler"},"id":"5900f4701000cf542c50ff82","block":"project-euler","challengeType":5,"title":"Problem 259: Reachable Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-259-reachable-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-260-stone-game","blockName":"Project Euler"},"id":"5900f4701000cf542c50ff83","block":"project-euler","challengeType":5,"title":"Problem 260: Stone Game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-260-stone-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-261-pivotal-square-sums","blockName":"Project Euler"},"id":"5900f4711000cf542c50ff84","block":"project-euler","challengeType":5,"title":"Problem 261: Pivotal Square Sums","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-261-pivotal-square-sums"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-262-mountain-range","blockName":"Project Euler"},"id":"5900f4731000cf542c50ff85","block":"project-euler","challengeType":5,"title":"Problem 262: Mountain Range","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-262-mountain-range"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true","blockName":"Project Euler"},"id":"5900f4741000cf542c50ff86","block":"project-euler","challengeType":5,"title":"Problem 263: An engineers' dream come true","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-263-an-engineers-dream-come-true"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-264-triangle-centres","blockName":"Project Euler"},"id":"5900f4751000cf542c50ff87","block":"project-euler","challengeType":5,"title":"Problem 264: Triangle Centres","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-264-triangle-centres"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-265-binary-circles","blockName":"Project Euler"},"id":"5900f4761000cf542c50ff88","block":"project-euler","challengeType":5,"title":"Problem 265: Binary Circles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-265-binary-circles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-266-pseudo-square-root","blockName":"Project Euler"},"id":"5900f4771000cf542c50ff89","block":"project-euler","challengeType":5,"title":"Problem 266: Pseudo Square Root","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-266-pseudo-square-root"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-267-billionaire","blockName":"Project Euler"},"id":"5900f4771000cf542c50ff8a","block":"project-euler","challengeType":5,"title":"Problem 267: Billionaire","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-267-billionaire"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100","blockName":"Project Euler"},"id":"5900f4791000cf542c50ff8b","block":"project-euler","challengeType":5,"title":"Problem 268: Counting numbers with at least four distinct prime factors less than 100","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root","blockName":"Project Euler"},"id":"5900f4791000cf542c50ff8c","block":"project-euler","challengeType":5,"title":"Problem 269: Polynomials with at least one integer root","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-269-polynomials-with-at-least-one-integer-root"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-270-cutting-squares","blockName":"Project Euler"},"id":"5900f47c1000cf542c50ff8e","block":"project-euler","challengeType":5,"title":"Problem 270: Cutting Squares","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-270-cutting-squares"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-271-modular-cubes-part-1","blockName":"Project Euler"},"id":"5900f47b1000cf542c50ff8d","block":"project-euler","challengeType":5,"title":"Problem 271: Modular Cubes, part 1","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-271-modular-cubes-part-1"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-272-modular-cubes-part-2","blockName":"Project Euler"},"id":"5900f47d1000cf542c50ff8f","block":"project-euler","challengeType":5,"title":"Problem 272: Modular Cubes, part 2","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-272-modular-cubes-part-2"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-273-sum-of-squares","blockName":"Project Euler"},"id":"5900f47e1000cf542c50ff90","block":"project-euler","challengeType":5,"title":"Problem 273: Sum of Squares","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-273-sum-of-squares"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-274-divisibility-multipliers","blockName":"Project Euler"},"id":"5900f47f1000cf542c50ff91","block":"project-euler","challengeType":5,"title":"Problem 274: Divisibility Multipliers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-274-divisibility-multipliers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-275-balanced-sculptures","blockName":"Project Euler"},"id":"5900f4801000cf542c50ff92","block":"project-euler","challengeType":5,"title":"Problem 275: Balanced Sculptures","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-275-balanced-sculptures"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-276-primitive-triangles","blockName":"Project Euler"},"id":"5900f4801000cf542c50ff93","block":"project-euler","challengeType":5,"title":"Problem 276: Primitive Triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-276-primitive-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence","blockName":"Project Euler"},"id":"5900f4811000cf542c50ff94","block":"project-euler","challengeType":5,"title":"Problem 277: A Modified Collatz sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-277-a-modified-collatz-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes","blockName":"Project Euler"},"id":"5900f4831000cf542c50ff95","block":"project-euler","challengeType":5,"title":"Problem 278: Linear Combinations of Semiprimes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-278-linear-combinations-of-semiprimes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle","blockName":"Project Euler"},"id":"5900f4841000cf542c50ff96","block":"project-euler","challengeType":5,"title":"Problem 279: Triangles with integral sides and an integral angle","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-279-triangles-with-integral-sides-and-an-integral-angle"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-280-ant-and-seeds","blockName":"Project Euler"},"id":"5900f4841000cf542c50ff97","block":"project-euler","challengeType":5,"title":"Problem 280: Ant and seeds","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-280-ant-and-seeds"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-281-pizza-toppings","blockName":"Project Euler"},"id":"5900f4861000cf542c50ff98","block":"project-euler","challengeType":5,"title":"Problem 281: Pizza Toppings","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-281-pizza-toppings"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-282-the-ackermann-function","blockName":"Project Euler"},"id":"5900f4861000cf542c50ff99","block":"project-euler","challengeType":5,"title":"Problem 282: The Ackermann function","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-282-the-ackermann-function"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral","blockName":"Project Euler"},"id":"5900f4881000cf542c50ff9a","block":"project-euler","challengeType":5,"title":"Problem 283: Integer sided triangles for which the area / perimeter ratio is integral","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-284-steady-squares","blockName":"Project Euler"},"id":"5900f4891000cf542c50ff9b","block":"project-euler","challengeType":5,"title":"Problem 284: Steady Squares","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-284-steady-squares"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-285-pythagorean-odds","blockName":"Project Euler"},"id":"5900f48a1000cf542c50ff9c","block":"project-euler","challengeType":5,"title":"Problem 285: Pythagorean odds","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-285-pythagorean-odds"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-286-scoring-probabilities","blockName":"Project Euler"},"id":"5900f48a1000cf542c50ff9d","block":"project-euler","challengeType":5,"title":"Problem 286: Scoring probabilities","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-286-scoring-probabilities"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm","blockName":"Project Euler"},"id":"5900f48b1000cf542c50ff9e","block":"project-euler","challengeType":5,"title":"Problem 287: Quadtree encoding (a simple compression algorithm)","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-287-quadtree-encoding-a-simple-compression-algorithm"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-288-an-enormous-factorial","blockName":"Project Euler"},"id":"5900f48d1000cf542c50ff9f","block":"project-euler","challengeType":5,"title":"Problem 288: An enormous factorial","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-288-an-enormous-factorial"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-289-eulerian-cycles","blockName":"Project Euler"},"id":"5900f48d1000cf542c50ffa0","block":"project-euler","challengeType":5,"title":"Problem 289: Eulerian Cycles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-289-eulerian-cycles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-290-digital-signature","blockName":"Project Euler"},"id":"5900f48f1000cf542c50ffa1","block":"project-euler","challengeType":5,"title":"Problem 290: Digital Signature","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-290-digital-signature"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-291-panaitopol-primes","blockName":"Project Euler"},"id":"5900f48f1000cf542c50ffa2","block":"project-euler","challengeType":5,"title":"Problem 291: Panaitopol Primes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-291-panaitopol-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-292-pythagorean-polygons","blockName":"Project Euler"},"id":"5900f4911000cf542c50ffa3","block":"project-euler","challengeType":5,"title":"Problem 292: Pythagorean Polygons","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-292-pythagorean-polygons"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers","blockName":"Project Euler"},"id":"5900f4931000cf542c50ffa4","block":"project-euler","challengeType":5,"title":"Problem 293: Pseudo-Fortunate Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-293-pseudo-fortunate-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23","blockName":"Project Euler"},"id":"5900f4931000cf542c50ffa5","block":"project-euler","challengeType":5,"title":"Problem 294: Sum of digits - experience #23","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-294-sum-of-digits---experience-23"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-295-lenticular-holes","blockName":"Project Euler"},"id":"5900f4931000cf542c50ffa6","block":"project-euler","challengeType":5,"title":"Problem 295: Lenticular holes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-295-lenticular-holes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent","blockName":"Project Euler"},"id":"5900f4941000cf542c50ffa7","block":"project-euler","challengeType":5,"title":"Problem 296: Angular Bisector and Tangent","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-296-angular-bisector-and-tangent"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-297-zeckendorf-representation","blockName":"Project Euler"},"id":"5900f4951000cf542c50ffa8","block":"project-euler","challengeType":5,"title":"Problem 297: Zeckendorf Representation","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-297-zeckendorf-representation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-298-selective-amnesia","blockName":"Project Euler"},"id":"5900f4971000cf542c50ffa9","block":"project-euler","challengeType":5,"title":"Problem 298: Selective Amnesia","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-298-selective-amnesia"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-299-three-similar-triangles","blockName":"Project Euler"},"id":"5900f4971000cf542c50ffaa","block":"project-euler","challengeType":5,"title":"Problem 299: Three similar triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-299-three-similar-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-300-protein-folding","blockName":"Project Euler"},"id":"5900f49a1000cf542c50ffac","block":"project-euler","challengeType":5,"title":"Problem 300: Protein folding","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-300-protein-folding"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-301-nim","blockName":"Project Euler"},"id":"5900f4991000cf542c50ffab","block":"project-euler","challengeType":5,"title":"Problem 301: Nim","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-301-nim"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-302-strong-achilles-numbers","blockName":"Project Euler"},"id":"5900f49b1000cf542c50ffad","block":"project-euler","challengeType":5,"title":"Problem 302: Strong Achilles Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-302-strong-achilles-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-303-multiples-with-small-digits","blockName":"Project Euler"},"id":"5900f49b1000cf542c50ffae","block":"project-euler","challengeType":5,"title":"Problem 303: Multiples with small digits","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-303-multiples-with-small-digits"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-304-primonacci","blockName":"Project Euler"},"id":"5900f49d1000cf542c50ffaf","block":"project-euler","challengeType":5,"title":"Problem 304: Primonacci","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-304-primonacci"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-305-reflexive-position","blockName":"Project Euler"},"id":"5900f49d1000cf542c50ffb0","block":"project-euler","challengeType":5,"title":"Problem 305: Reflexive Position","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-305-reflexive-position"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-306-paper-strip-game","blockName":"Project Euler"},"id":"5900f49f1000cf542c50ffb1","block":"project-euler","challengeType":5,"title":"Problem 306: Paper-strip Game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-306-paper-strip-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-307-chip-defects","blockName":"Project Euler"},"id":"5900f4a01000cf542c50ffb2","block":"project-euler","challengeType":5,"title":"Problem 307: Chip Defects","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-307-chip-defects"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton","blockName":"Project Euler"},"id":"5900f4a11000cf542c50ffb3","block":"project-euler","challengeType":5,"title":"Problem 308: An amazing Prime-generating Automaton","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-308-an-amazing-prime-generating-automaton"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-309-integer-ladders","blockName":"Project Euler"},"id":"5900f4a11000cf542c50ffb4","block":"project-euler","challengeType":5,"title":"Problem 309: Integer Ladders","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-309-integer-ladders"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-310-nim-square","blockName":"Project Euler"},"id":"5900f4a21000cf542c50ffb5","block":"project-euler","challengeType":5,"title":"Problem 310: Nim Square","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-310-nim-square"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals","blockName":"Project Euler"},"id":"5900f4a31000cf542c50ffb6","block":"project-euler","challengeType":5,"title":"Problem 311: Biclinic Integral Quadrilaterals","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-311-biclinic-integral-quadrilaterals"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs","blockName":"Project Euler"},"id":"5900f4a51000cf542c50ffb7","block":"project-euler","challengeType":5,"title":"Problem 312: Cyclic paths on Sierpiński graphs","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-312-cyclic-paths-on-sierpiski-graphs"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-313-sliding-game","blockName":"Project Euler"},"id":"5900f4a61000cf542c50ffb8","block":"project-euler","challengeType":5,"title":"Problem 313: Sliding game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-313-sliding-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon","blockName":"Project Euler"},"id":"5900f4a71000cf542c50ffb9","block":"project-euler","challengeType":5,"title":"Problem 314: The Mouse on the Moon","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-314-the-mouse-on-the-moon"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-315-digital-root-clocks","blockName":"Project Euler"},"id":"5900f4a71000cf542c50ffba","block":"project-euler","challengeType":5,"title":"Problem 315: Digital root clocks","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-315-digital-root-clocks"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions","blockName":"Project Euler"},"id":"5900f4a81000cf542c50ffbb","block":"project-euler","challengeType":5,"title":"Problem 316: Numbers in decimal expansions","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-316-numbers-in-decimal-expansions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-317-firecracker","blockName":"Project Euler"},"id":"5900f4aa1000cf542c50ffbc","block":"project-euler","challengeType":5,"title":"Problem 317: Firecracker","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-317-firecracker"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-318-2011-nines","blockName":"Project Euler"},"id":"5900f4ab1000cf542c50ffbd","block":"project-euler","challengeType":5,"title":"Problem 318: 2011 nines","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-318-2011-nines"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-319-bounded-sequences","blockName":"Project Euler"},"id":"5900f4ab1000cf542c50ffbe","block":"project-euler","challengeType":5,"title":"Problem 319: Bounded Sequences","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-319-bounded-sequences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer","blockName":"Project Euler"},"id":"5900f4ae1000cf542c50ffbf","block":"project-euler","challengeType":5,"title":"Problem 320: Factorials divisible by a huge integer","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-320-factorials-divisible-by-a-huge-integer"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-321-swapping-counters","blockName":"Project Euler"},"id":"5900f4ae1000cf542c50ffc0","block":"project-euler","challengeType":5,"title":"Problem 321: Swapping Counters","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-321-swapping-counters"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10","blockName":"Project Euler"},"id":"5900f4af1000cf542c50ffc1","block":"project-euler","challengeType":5,"title":"Problem 322: Binomial coefficients divisible by 10","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-322-binomial-coefficients-divisible-by-10"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers","blockName":"Project Euler"},"id":"5900f4b01000cf542c50ffc2","block":"project-euler","challengeType":5,"title":"Problem 323: Bitwise-OR operations on random integers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-323-bitwise-or-operations-on-random-integers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-324-building-a-tower","blockName":"Project Euler"},"id":"5900f4b11000cf542c50ffc3","block":"project-euler","challengeType":5,"title":"Problem 324: Building a tower","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-324-building-a-tower"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-325-stone-game-ii","blockName":"Project Euler"},"id":"5900f4b11000cf542c50ffc4","block":"project-euler","challengeType":5,"title":"Problem 325: Stone Game II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-325-stone-game-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-326-modulo-summations","blockName":"Project Euler"},"id":"5900f4b21000cf542c50ffc5","block":"project-euler","challengeType":5,"title":"Problem 326: Modulo Summations","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-326-modulo-summations"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-327-rooms-of-doom","blockName":"Project Euler"},"id":"5900f4b31000cf542c50ffc6","block":"project-euler","challengeType":5,"title":"Problem 327: Rooms of Doom","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-327-rooms-of-doom"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-328-lowest-cost-search","blockName":"Project Euler"},"id":"5900f4b41000cf542c50ffc7","block":"project-euler","challengeType":5,"title":"Problem 328: Lowest-cost Search","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-328-lowest-cost-search"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-329-prime-frog","blockName":"Project Euler"},"id":"5900f4b51000cf542c50ffc8","block":"project-euler","challengeType":5,"title":"Problem 329: Prime Frog","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-329-prime-frog"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-330-eulers-number","blockName":"Project Euler"},"id":"5900f4b71000cf542c50ffc9","block":"project-euler","challengeType":5,"title":"Problem 330: Euler's Number","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-330-eulers-number"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-331-cross-flips","blockName":"Project Euler"},"id":"5900f4b71000cf542c50ffca","block":"project-euler","challengeType":5,"title":"Problem 331: Cross flips","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-331-cross-flips"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-332-spherical-triangles","blockName":"Project Euler"},"id":"5900f4b91000cf542c50ffcb","block":"project-euler","challengeType":5,"title":"Problem 332: Spherical triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-332-spherical-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-333-special-partitions","blockName":"Project Euler"},"id":"5900f4b91000cf542c50ffcc","block":"project-euler","challengeType":5,"title":"Problem 333: Special partitions","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-333-special-partitions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-334-spilling-the-beans","blockName":"Project Euler"},"id":"5900f4ba1000cf542c50ffcd","block":"project-euler","challengeType":5,"title":"Problem 334: Spilling the beans","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-334-spilling-the-beans"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-335-gathering-the-beans","blockName":"Project Euler"},"id":"5900f4bd1000cf542c50ffce","block":"project-euler","challengeType":5,"title":"Problem 335: Gathering the beans","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-335-gathering-the-beans"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-336-maximix-arrangements","blockName":"Project Euler"},"id":"5900f4bd1000cf542c50ffcf","block":"project-euler","challengeType":5,"title":"Problem 336: Maximix Arrangements","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-336-maximix-arrangements"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences","blockName":"Project Euler"},"id":"5900f4be1000cf542c50ffd0","block":"project-euler","challengeType":5,"title":"Problem 337: Totient Stairstep Sequences","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-337-totient-stairstep-sequences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper","blockName":"Project Euler"},"id":"5900f4be1000cf542c50ffd1","block":"project-euler","challengeType":5,"title":"Problem 338: Cutting Rectangular Grid Paper","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-338-cutting-rectangular-grid-paper"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg","blockName":"Project Euler"},"id":"5900f4c01000cf542c50ffd2","block":"project-euler","challengeType":5,"title":"Problem 339: Peredur fab Efrawg","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-339-peredur-fab-efrawg"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-340-crazy-function","blockName":"Project Euler"},"id":"5900f4c21000cf542c50ffd4","block":"project-euler","challengeType":5,"title":"Problem 340: Crazy Function","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-340-crazy-function"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence","blockName":"Project Euler"},"id":"5900f4c11000cf542c50ffd3","block":"project-euler","challengeType":5,"title":"Problem 341: Golomb's self-describing sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-341-golombs-self-describing-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube","blockName":"Project Euler"},"id":"5900f4c31000cf542c50ffd5","block":"project-euler","challengeType":5,"title":"Problem 342: The totient of a square is a cube","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-342-the-totient-of-a-square-is-a-cube"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-343-fractional-sequences","blockName":"Project Euler"},"id":"5900f4c41000cf542c50ffd6","block":"project-euler","challengeType":5,"title":"Problem 343: Fractional Sequences","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-343-fractional-sequences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-344-silver-dollar-game","blockName":"Project Euler"},"id":"5900f4c51000cf542c50ffd7","block":"project-euler","challengeType":5,"title":"Problem 344: Silver dollar game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-344-silver-dollar-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-345-matrix-sum","blockName":"Project Euler"},"id":"5900f4c81000cf542c50ffda","block":"project-euler","challengeType":5,"title":"Problem 345: Matrix Sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-345-matrix-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-346-strong-repunits","blockName":"Project Euler"},"id":"5900f4c71000cf542c50ffd8","block":"project-euler","challengeType":5,"title":"Problem 346: Strong Repunits","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-346-strong-repunits"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes","blockName":"Project Euler"},"id":"5900f4c81000cf542c50ffd9","block":"project-euler","challengeType":5,"title":"Problem 347: Largest integer divisible by two primes","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-347-largest-integer-divisible-by-two-primes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube","blockName":"Project Euler"},"id":"5900f4c81000cf542c50ffdb","block":"project-euler","challengeType":5,"title":"Problem 348: Sum of a square and a cube","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-348-sum-of-a-square-and-a-cube"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-349-langtons-ant","blockName":"Project Euler"},"id":"5900f4ca1000cf542c50ffdc","block":"project-euler","challengeType":5,"title":"Problem 349: Langton's ant","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-349-langtons-ant"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least","blockName":"Project Euler"},"id":"5900f4cb1000cf542c50ffdd","block":"project-euler","challengeType":5,"title":"Problem 350: Constraining the least greatest and the greatest least","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-350-constraining-the-least-greatest-and-the-greatest-least"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-351-hexagonal-orchards","blockName":"Project Euler"},"id":"5900f4cb1000cf542c50ffde","block":"project-euler","challengeType":5,"title":"Problem 351: Hexagonal orchards","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-351-hexagonal-orchards"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-352-blood-tests","blockName":"Project Euler"},"id":"5900f4cd1000cf542c50ffdf","block":"project-euler","challengeType":5,"title":"Problem 352: Blood tests","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-352-blood-tests"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-353-risky-moon","blockName":"Project Euler"},"id":"5900f4cd1000cf542c50ffe0","block":"project-euler","challengeType":5,"title":"Problem 353: Risky moon","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-353-risky-moon"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb","blockName":"Project Euler"},"id":"5900f4cf1000cf542c50ffe1","block":"project-euler","challengeType":5,"title":"Problem 354: Distances in a bee's honeycomb","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-354-distances-in-a-bees-honeycomb"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-355-maximal-coprime-subset","blockName":"Project Euler"},"id":"5900f4d01000cf542c50ffe2","block":"project-euler","challengeType":5,"title":"Problem 355: Maximal coprime subset","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-355-maximal-coprime-subset"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials","blockName":"Project Euler"},"id":"5900f4d01000cf542c50ffe3","block":"project-euler","challengeType":5,"title":"Problem 356: Largest roots of cubic polynomials","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-356-largest-roots-of-cubic-polynomials"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-357-prime-generating-integers","blockName":"Project Euler"},"id":"5900f4d11000cf542c50ffe4","block":"project-euler","challengeType":5,"title":"Problem 357: Prime generating integers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-357-prime-generating-integers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-358-cyclic-numbers","blockName":"Project Euler"},"id":"5900f4d21000cf542c50ffe5","block":"project-euler","challengeType":5,"title":"Problem 358: Cyclic numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-358-cyclic-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-359-hilberts-new-hotel","blockName":"Project Euler"},"id":"5900f4d31000cf542c50ffe6","block":"project-euler","challengeType":5,"title":"Problem 359: Hilbert's New Hotel","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-359-hilberts-new-hotel"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-360-scary-sphere","blockName":"Project Euler"},"id":"5900f4d41000cf542c50ffe7","block":"project-euler","challengeType":5,"title":"Problem 360: Scary Sphere","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-360-scary-sphere"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence","blockName":"Project Euler"},"id":"5900f4d51000cf542c50ffe8","block":"project-euler","challengeType":5,"title":"Problem 361: Subsequence of Thue-Morse sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-361-subsequence-of-thue-morse-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-362-squarefree-factors","blockName":"Project Euler"},"id":"5900f4d61000cf542c50ffe9","block":"project-euler","challengeType":5,"title":"Problem 362: Squarefree factors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-362-squarefree-factors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-363-bzier-curves","blockName":"Project Euler"},"id":"5900f4d91000cf542c50ffeb","block":"project-euler","challengeType":5,"title":"Problem 363: Bézier Curves","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-363-bzier-curves"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-364-comfortable-distance","blockName":"Project Euler"},"id":"5900f4d91000cf542c50ffea","block":"project-euler","challengeType":5,"title":"Problem 364: Comfortable distance","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-364-comfortable-distance"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient","blockName":"Project Euler"},"id":"5900f4da1000cf542c50ffec","block":"project-euler","challengeType":5,"title":"Problem 365: A huge binomial coefficient","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-365-a-huge-binomial-coefficient"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-366-stone-game-iii","blockName":"Project Euler"},"id":"5900f4da1000cf542c50ffed","block":"project-euler","challengeType":5,"title":"Problem 366: Stone Game III","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-366-stone-game-iii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-367-bozo-sort","blockName":"Project Euler"},"id":"5900f4db1000cf542c50ffee","block":"project-euler","challengeType":5,"title":"Problem 367: Bozo sort","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-367-bozo-sort"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-368-a-kempner-like-series","blockName":"Project Euler"},"id":"5900f4dd1000cf542c50ffef","block":"project-euler","challengeType":5,"title":"Problem 368: A Kempner-like series","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-368-a-kempner-like-series"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-369-badugi","blockName":"Project Euler"},"id":"5900f4de1000cf542c50fff0","block":"project-euler","challengeType":5,"title":"Problem 369: Badugi","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-369-badugi"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-370-geometric-triangles","blockName":"Project Euler"},"id":"5900f4de1000cf542c50fff1","block":"project-euler","challengeType":5,"title":"Problem 370: Geometric triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-370-geometric-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-371-licence-plates","blockName":"Project Euler"},"id":"5900f4e01000cf542c50fff2","block":"project-euler","challengeType":5,"title":"Problem 371: Licence plates","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-371-licence-plates"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-372-pencils-of-rays","blockName":"Project Euler"},"id":"5900f4e11000cf542c50fff3","block":"project-euler","challengeType":5,"title":"Problem 372: Pencils of rays","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-372-pencils-of-rays"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-373-circumscribed-circles","blockName":"Project Euler"},"id":"5900f4e11000cf542c50fff4","block":"project-euler","challengeType":5,"title":"Problem 373: Circumscribed Circles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-373-circumscribed-circles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product","blockName":"Project Euler"},"id":"5900f4e51000cf542c50fff6","block":"project-euler","challengeType":5,"title":"Problem 374: Maximum Integer Partition Product","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-374-maximum-integer-partition-product"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-375-minimum-of-subsequences","blockName":"Project Euler"},"id":"5900f4e41000cf542c50fff5","block":"project-euler","challengeType":5,"title":"Problem 375: Minimum of subsequences","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-375-minimum-of-subsequences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice","blockName":"Project Euler"},"id":"5900f4e51000cf542c50fff7","block":"project-euler","challengeType":5,"title":"Problem 376: Nontransitive sets of dice","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-376-nontransitive-sets-of-dice"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13","blockName":"Project Euler"},"id":"5900f4e51000cf542c50fff8","block":"project-euler","challengeType":5,"title":"Problem 377: Sum of digits, experience 13","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-377-sum-of-digits-experience-13"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-378-triangle-triples","blockName":"Project Euler"},"id":"5900f4e61000cf542c50fff9","block":"project-euler","challengeType":5,"title":"Problem 378: Triangle Triples","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-378-triangle-triples"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-379-least-common-multiple-count","blockName":"Project Euler"},"id":"5900f4e81000cf542c50fffa","block":"project-euler","challengeType":5,"title":"Problem 379: Least common multiple count","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-379-least-common-multiple-count"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-380-amazing-mazes","blockName":"Project Euler"},"id":"5900f4e81000cf542c50fffb","block":"project-euler","challengeType":5,"title":"Problem 380: Amazing Mazes!","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-380-amazing-mazes"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-381-prime-k-factorial","blockName":"Project Euler"},"id":"5900f4ea1000cf542c50fffc","block":"project-euler","challengeType":5,"title":"Problem 381: (prime-k) factorial","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-381-prime-k-factorial"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-382-generating-polygons","blockName":"Project Euler"},"id":"5900f4eb1000cf542c50fffd","block":"project-euler","challengeType":5,"title":"Problem 382: Generating polygons","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-382-generating-polygons"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials","blockName":"Project Euler"},"id":"5900f4ed1000cf542c50ffff","block":"project-euler","challengeType":5,"title":"Problem 383: Divisibility comparison between factorials","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-383-divisibility-comparison-between-factorials"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence","blockName":"Project Euler"},"id":"5900f4ed1000cf542c50fffe","block":"project-euler","challengeType":5,"title":"Problem 384: Rudin-Shapiro sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-384-rudin-shapiro-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles","blockName":"Project Euler"},"id":"5900f4ee1000cf542c510000","block":"project-euler","challengeType":5,"title":"Problem 385: Ellipses inside triangles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-385-ellipses-inside-triangles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain","blockName":"Project Euler"},"id":"5900f4ef1000cf542c510001","block":"project-euler","challengeType":5,"title":"Problem 386: Maximum length of an antichain","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-386-maximum-length-of-an-antichain"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-387-harshad-numbers","blockName":"Project Euler"},"id":"5900f4f11000cf542c510003","block":"project-euler","challengeType":5,"title":"Problem 387: Harshad Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-387-harshad-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-388-distinct-lines","blockName":"Project Euler"},"id":"5900f4f11000cf542c510002","block":"project-euler","challengeType":5,"title":"Problem 388: Distinct Lines","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-388-distinct-lines"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-389-platonic-dice","blockName":"Project Euler"},"id":"5900f4f21000cf542c510004","block":"project-euler","challengeType":5,"title":"Problem 389: Platonic Dice","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-389-platonic-dice"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area","blockName":"Project Euler"},"id":"5900f4f21000cf542c510005","block":"project-euler","challengeType":5,"title":"Problem 390: Triangles with non rational sides and integral area","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-390-triangles-with-non-rational-sides-and-integral-area"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-391-hopping-game","blockName":"Project Euler"},"id":"5900f4f31000cf542c510006","block":"project-euler","challengeType":5,"title":"Problem 391: Hopping Game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-391-hopping-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle","blockName":"Project Euler"},"id":"5900f4f41000cf542c510007","block":"project-euler","challengeType":5,"title":"Problem 392: Enmeshed unit circle","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-392-enmeshed-unit-circle"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-393-migrating-ants","blockName":"Project Euler"},"id":"5900f4f61000cf542c510008","block":"project-euler","challengeType":5,"title":"Problem 393: Migrating ants","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-393-migrating-ants"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-394-eating-pie","blockName":"Project Euler"},"id":"5900f4f71000cf542c510009","block":"project-euler","challengeType":5,"title":"Problem 394: Eating pie","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-394-eating-pie"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-395-pythagorean-tree","blockName":"Project Euler"},"id":"5900f4f71000cf542c51000a","block":"project-euler","challengeType":5,"title":"Problem 395: Pythagorean tree","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-395-pythagorean-tree"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence","blockName":"Project Euler"},"id":"5900f4f81000cf542c51000b","block":"project-euler","challengeType":5,"title":"Problem 396: Weak Goodstein sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-396-weak-goodstein-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-397-triangle-on-parabola","blockName":"Project Euler"},"id":"5900f4f91000cf542c51000c","block":"project-euler","challengeType":5,"title":"Problem 397: Triangle on parabola","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-397-triangle-on-parabola"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-398-cutting-rope","blockName":"Project Euler"},"id":"5900f4fa1000cf542c51000d","block":"project-euler","challengeType":5,"title":"Problem 398: Cutting rope","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-398-cutting-rope"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers","blockName":"Project Euler"},"id":"5900f4fc1000cf542c51000e","block":"project-euler","challengeType":5,"title":"Problem 399: Squarefree Fibonacci Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-399-squarefree-fibonacci-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-400-fibonacci-tree-game","blockName":"Project Euler"},"id":"5900f4fe1000cf542c510010","block":"project-euler","challengeType":5,"title":"Problem 400: Fibonacci tree game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-400-fibonacci-tree-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors","blockName":"Project Euler"},"id":"5900f4fd1000cf542c51000f","block":"project-euler","challengeType":5,"title":"Problem 401: Sum of squares of divisors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-401-sum-of-squares-of-divisors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-402-integer-valued-polynomials","blockName":"Project Euler"},"id":"5900f4ff1000cf542c510011","block":"project-euler","challengeType":5,"title":"Problem 402: Integer-valued polynomials","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-402-integer-valued-polynomials"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line","blockName":"Project Euler"},"id":"5900f5001000cf542c510013","block":"project-euler","challengeType":5,"title":"Problem 403: Lattice points enclosed by parabola and line","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-403-lattice-points-enclosed-by-parabola-and-line"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-404-crisscross-ellipses","blockName":"Project Euler"},"id":"5900f5001000cf542c510012","block":"project-euler","challengeType":5,"title":"Problem 404: Crisscross Ellipses","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-404-crisscross-ellipses"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-405-a-rectangular-tiling","blockName":"Project Euler"},"id":"5900f5021000cf542c510014","block":"project-euler","challengeType":5,"title":"Problem 405: A rectangular tiling","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-405-a-rectangular-tiling"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-406-guessing-game","blockName":"Project Euler"},"id":"5900f5021000cf542c510015","block":"project-euler","challengeType":5,"title":"Problem 406: Guessing Game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-406-guessing-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-407-idempotents","blockName":"Project Euler"},"id":"5900f5041000cf542c510016","block":"project-euler","challengeType":5,"title":"Problem 407: Idempotents","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-407-idempotents"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid","blockName":"Project Euler"},"id":"5900f5091000cf542c51001b","block":"project-euler","challengeType":5,"title":"Problem 408: Admissible paths through a grid","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-408-admissible-paths-through-a-grid"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-409-nim-extreme","blockName":"Project Euler"},"id":"5900f5061000cf542c510017","block":"project-euler","challengeType":5,"title":"Problem 409: Nim Extreme","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-409-nim-extreme"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-410-circle-and-tangent-line","blockName":"Project Euler"},"id":"5900f5071000cf542c510018","block":"project-euler","challengeType":5,"title":"Problem 410: Circle and tangent line","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-410-circle-and-tangent-line"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-411-uphill-paths","blockName":"Project Euler"},"id":"5900f5081000cf542c510019","block":"project-euler","challengeType":5,"title":"Problem 411: Uphill paths","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-411-uphill-paths"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-412-gnomon-numbering","blockName":"Project Euler"},"id":"5900f5081000cf542c51001a","block":"project-euler","challengeType":5,"title":"Problem 412: Gnomon numbering","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-412-gnomon-numbering"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-413-one-child-numbers","blockName":"Project Euler"},"id":"5900f50a1000cf542c51001c","block":"project-euler","challengeType":5,"title":"Problem 413: One-child Numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-413-one-child-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-414-kaprekar-constant","blockName":"Project Euler"},"id":"5900f50b1000cf542c51001d","block":"project-euler","challengeType":5,"title":"Problem 414: Kaprekar constant","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-414-kaprekar-constant"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-415-titanic-sets","blockName":"Project Euler"},"id":"5900f50c1000cf542c51001e","block":"project-euler","challengeType":5,"title":"Problem 415: Titanic sets","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-415-titanic-sets"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-416-a-frogs-trip","blockName":"Project Euler"},"id":"5900f50e1000cf542c510020","block":"project-euler","challengeType":5,"title":"Problem 416: A frog's trip","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-416-a-frogs-trip"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii","blockName":"Project Euler"},"id":"5900f50d1000cf542c51001f","block":"project-euler","challengeType":5,"title":"Problem 417: Reciprocal cycles II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-417-reciprocal-cycles-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-418-factorisation-triples","blockName":"Project Euler"},"id":"5900f50f1000cf542c510021","block":"project-euler","challengeType":5,"title":"Problem 418: Factorisation triples","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-418-factorisation-triples"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-419-look-and-say-sequence","blockName":"Project Euler"},"id":"5900f5101000cf542c510022","block":"project-euler","challengeType":5,"title":"Problem 419: Look and say sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-419-look-and-say-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix","blockName":"Project Euler"},"id":"5900f5111000cf542c510023","block":"project-euler","challengeType":5,"title":"Problem 420: 2x2 positive integer matrix","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-420-2x2-positive-integer-matrix"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-421-prime-factors-of-n151","blockName":"Project Euler"},"id":"5900f5131000cf542c510024","block":"project-euler","challengeType":5,"title":"Problem 421: Prime factors of n15+1","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-421-prime-factors-of-n151"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola","blockName":"Project Euler"},"id":"5900f5131000cf542c510025","block":"project-euler","challengeType":5,"title":"Problem 422: Sequence of points on a hyperbola","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-422-sequence-of-points-on-a-hyperbola"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-423-consecutive-die-throws","blockName":"Project Euler"},"id":"5900f5141000cf542c510027","block":"project-euler","challengeType":5,"title":"Problem 423: Consecutive die throws","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-423-consecutive-die-throws"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-424-kakuro","blockName":"Project Euler"},"id":"5900f5141000cf542c510026","block":"project-euler","challengeType":5,"title":"Problem 424: Kakuro","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-424-kakuro"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-425-prime-connection","blockName":"Project Euler"},"id":"5900f5151000cf542c510028","block":"project-euler","challengeType":5,"title":"Problem 425: Prime connection","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-425-prime-connection"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-426-box-ball-system","blockName":"Project Euler"},"id":"5900f5171000cf542c510029","block":"project-euler","challengeType":5,"title":"Problem 426: Box-ball system","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-426-box-ball-system"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-427-n-sequences","blockName":"Project Euler"},"id":"5900f5181000cf542c51002a","block":"project-euler","challengeType":5,"title":"Problem 427: n-sequences","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-427-n-sequences"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-428-necklace-of-circles","blockName":"Project Euler"},"id":"5900f5191000cf542c51002b","block":"project-euler","challengeType":5,"title":"Problem 428: Necklace of Circles","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-428-necklace-of-circles"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors","blockName":"Project Euler"},"id":"5900f5191000cf542c51002c","block":"project-euler","challengeType":5,"title":"Problem 429: Sum of squares of unitary divisors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-429-sum-of-squares-of-unitary-divisors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-430-range-flips","blockName":"Project Euler"},"id":"5900f51a1000cf542c51002d","block":"project-euler","challengeType":5,"title":"Problem 430: Range flips","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-430-range-flips"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-431-square-space-silo","blockName":"Project Euler"},"id":"5900f51b1000cf542c51002e","block":"project-euler","challengeType":5,"title":"Problem 431: Square Space Silo","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-431-square-space-silo"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-432-totient-sum","blockName":"Project Euler"},"id":"5900f51e1000cf542c510030","block":"project-euler","challengeType":5,"title":"Problem 432: Totient sum","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-432-totient-sum"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm","blockName":"Project Euler"},"id":"5900f51d1000cf542c51002f","block":"project-euler","challengeType":5,"title":"Problem 433: Steps in Euclid's algorithm","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-433-steps-in-euclids-algorithm"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-434-rigid-graphs","blockName":"Project Euler"},"id":"5900f51f1000cf542c510031","block":"project-euler","challengeType":5,"title":"Problem 434: Rigid graphs","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-434-rigid-graphs"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers","blockName":"Project Euler"},"id":"5900f5201000cf542c510032","block":"project-euler","challengeType":5,"title":"Problem 435: Polynomials of Fibonacci numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-435-polynomials-of-fibonacci-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-436-unfair-wager","blockName":"Project Euler"},"id":"5900f5221000cf542c510033","block":"project-euler","challengeType":5,"title":"Problem 436: Unfair wager","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-436-unfair-wager"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots","blockName":"Project Euler"},"id":"5900f5241000cf542c510036","block":"project-euler","challengeType":5,"title":"Problem 437: Fibonacci primitive roots","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-437-fibonacci-primitive-roots"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions","blockName":"Project Euler"},"id":"5900f5231000cf542c510034","block":"project-euler","challengeType":5,"title":"Problem 438: Integer part of polynomial equation's solutions","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-438-integer-part-of-polynomial-equations-solutions"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors","blockName":"Project Euler"},"id":"5900f5231000cf542c510035","block":"project-euler","challengeType":5,"title":"Problem 439: Sum of sum of divisors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-439-sum-of-sum-of-divisors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-440-gcd-and-tiling","blockName":"Project Euler"},"id":"5900f5241000cf542c510037","block":"project-euler","challengeType":5,"title":"Problem 440: GCD and Tiling","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-440-gcd-and-tiling"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples","blockName":"Project Euler"},"id":"5900f5261000cf542c510038","block":"project-euler","challengeType":5,"title":"Problem 441: The inverse summation of coprime couples","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-441-the-inverse-summation-of-coprime-couples"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-442-eleven-free-integers","blockName":"Project Euler"},"id":"5900f5271000cf542c510039","block":"project-euler","challengeType":5,"title":"Problem 442: Eleven-free integers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-442-eleven-free-integers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-443-gcd-sequence","blockName":"Project Euler"},"id":"5900f5271000cf542c51003a","block":"project-euler","challengeType":5,"title":"Problem 443: GCD sequence","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-443-gcd-sequence"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-444-the-roundtable-lottery","blockName":"Project Euler"},"id":"5900f52a1000cf542c51003b","block":"project-euler","challengeType":5,"title":"Problem 444: The Roundtable Lottery","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-444-the-roundtable-lottery"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-445-retractions-a","blockName":"Project Euler"},"id":"5900f52a1000cf542c51003c","block":"project-euler","challengeType":5,"title":"Problem 445: Retractions A","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-445-retractions-a"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-446-retractions-b","blockName":"Project Euler"},"id":"5900f52c1000cf542c51003d","block":"project-euler","challengeType":5,"title":"Problem 446: Retractions B","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-446-retractions-b"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-447-retractions-c","blockName":"Project Euler"},"id":"5900f52c1000cf542c51003e","block":"project-euler","challengeType":5,"title":"Problem 447: Retractions C","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-447-retractions-c"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-448-average-least-common-multiple","blockName":"Project Euler"},"id":"5900f52c1000cf542c51003f","block":"project-euler","challengeType":5,"title":"Problem 448: Average least common multiple","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-448-average-least-common-multiple"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-449-chocolate-covered-candy","blockName":"Project Euler"},"id":"5900f52d1000cf542c510040","block":"project-euler","challengeType":5,"title":"Problem 449: Chocolate covered candy","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-449-chocolate-covered-candy"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points","blockName":"Project Euler"},"id":"5900f52e1000cf542c510041","block":"project-euler","challengeType":5,"title":"Problem 450: Hypocycloid and Lattice points","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-450-hypocycloid-and-lattice-points"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-451-modular-inverses","blockName":"Project Euler"},"id":"5900f5311000cf542c510042","block":"project-euler","challengeType":5,"title":"Problem 451: Modular inverses","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-451-modular-inverses"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-452-long-products","blockName":"Project Euler"},"id":"5900f5311000cf542c510043","block":"project-euler","challengeType":5,"title":"Problem 452: Long Products","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-452-long-products"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals","blockName":"Project Euler"},"id":"5900f5311000cf542c510044","block":"project-euler","challengeType":5,"title":"Problem 453: Lattice Quadrilaterals","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-453-lattice-quadrilaterals"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii","blockName":"Project Euler"},"id":"5900f5331000cf542c510045","block":"project-euler","challengeType":5,"title":"Problem 454: Diophantine reciprocals III","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-454-diophantine-reciprocals-iii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits","blockName":"Project Euler"},"id":"5900f5331000cf542c510046","block":"project-euler","challengeType":5,"title":"Problem 455: Powers With Trailing Digits","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-455-powers-with-trailing-digits"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii","blockName":"Project Euler"},"id":"5900f5351000cf542c510047","block":"project-euler","challengeType":5,"title":"Problem 456: Triangles containing the origin II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-456-triangles-containing-the-origin-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime","blockName":"Project Euler"},"id":"5900f5361000cf542c510048","block":"project-euler","challengeType":5,"title":"Problem 457: A polynomial modulo the square of a prime","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-457-a-polynomial-modulo-the-square-of-a-prime"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-458-permutations-of-project","blockName":"Project Euler"},"id":"5900f5361000cf542c510049","block":"project-euler","challengeType":5,"title":"Problem 458: Permutations of Project","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-458-permutations-of-project"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-459-flipping-game","blockName":"Project Euler"},"id":"5900f5371000cf542c51004a","block":"project-euler","challengeType":5,"title":"Problem 459: Flipping game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-459-flipping-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-460-an-ant-on-the-move","blockName":"Project Euler"},"id":"5900f5381000cf542c51004b","block":"project-euler","challengeType":5,"title":"Problem 460: An ant on the move","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-460-an-ant-on-the-move"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-461-almost-pi","blockName":"Project Euler"},"id":"5900f53a1000cf542c51004c","block":"project-euler","challengeType":5,"title":"Problem 461: Almost Pi","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-461-almost-pi"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers","blockName":"Project Euler"},"id":"5900f53b1000cf542c51004d","block":"project-euler","challengeType":5,"title":"Problem 462: Permutation of 3-smooth numbers","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-462-permutation-of-3-smooth-numbers"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation","blockName":"Project Euler"},"id":"5900f53c1000cf542c51004e","block":"project-euler","challengeType":5,"title":"Problem 463: A weird recurrence relation","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-463-a-weird-recurrence-relation"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals","blockName":"Project Euler"},"id":"5900f53d1000cf542c51004f","block":"project-euler","challengeType":5,"title":"Problem 464: Möbius function and intervals","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-464-mbius-function-and-intervals"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-465-polar-polygons","blockName":"Project Euler"},"id":"5900f53d1000cf542c510050","block":"project-euler","challengeType":5,"title":"Problem 465: Polar polygons","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-465-polar-polygons"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table","blockName":"Project Euler"},"id":"5900f53e1000cf542c510051","block":"project-euler","challengeType":5,"title":"Problem 466: Distinct terms in a multiplication table","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-466-distinct-terms-in-a-multiplication-table"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-467-superinteger","blockName":"Project Euler"},"id":"5900f5411000cf542c510052","block":"project-euler","challengeType":5,"title":"Problem 467: Superinteger","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-467-superinteger"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients","blockName":"Project Euler"},"id":"5900f5411000cf542c510054","block":"project-euler","challengeType":5,"title":"Problem 468: Smooth divisors of binomial coefficients","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-468-smooth-divisors-of-binomial-coefficients"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-469-empty-chairs","blockName":"Project Euler"},"id":"5900f5411000cf542c510053","block":"project-euler","challengeType":5,"title":"Problem 469: Empty chairs","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-469-empty-chairs"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-470-super-ramvok","blockName":"Project Euler"},"id":"5900f5431000cf542c510055","block":"project-euler","challengeType":5,"title":"Problem 470: Super Ramvok","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-470-super-ramvok"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse","blockName":"Project Euler"},"id":"5900f5431000cf542c510056","block":"project-euler","challengeType":5,"title":"Problem 471: Triangle inscribed in ellipse","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-471-triangle-inscribed-in-ellipse"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-472-comfortable-distance-ii","blockName":"Project Euler"},"id":"5900f5451000cf542c510057","block":"project-euler","challengeType":5,"title":"Problem 472: Comfortable Distance II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-472-comfortable-distance-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-473-phigital-number-base","blockName":"Project Euler"},"id":"5900f5461000cf542c510058","block":"project-euler","challengeType":5,"title":"Problem 473: Phigital number base","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-473-phigital-number-base"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-474-last-digits-of-divisors","blockName":"Project Euler"},"id":"5900f5471000cf542c510059","block":"project-euler","challengeType":5,"title":"Problem 474: Last digits of divisors","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-474-last-digits-of-divisors"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-475-music-festival","blockName":"Project Euler"},"id":"5900f5481000cf542c51005a","block":"project-euler","challengeType":5,"title":"Problem 475: Music festival","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-475-music-festival"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-476-circle-packing-ii","blockName":"Project Euler"},"id":"5900f5481000cf542c51005b","block":"project-euler","challengeType":5,"title":"Problem 476: Circle Packing II","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-476-circle-packing-ii"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-477-number-sequence-game","blockName":"Project Euler"},"id":"5900f54a1000cf542c51005c","block":"project-euler","challengeType":5,"title":"Problem 477: Number Sequence Game","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-477-number-sequence-game"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-478-mixtures","blockName":"Project Euler"},"id":"5900f54c1000cf542c51005e","block":"project-euler","challengeType":5,"title":"Problem 478: Mixtures","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-478-mixtures"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-479-roots-on-the-rise","blockName":"Project Euler"},"id":"5900f54b1000cf542c51005d","block":"project-euler","challengeType":5,"title":"Problem 479: Roots on the Rise","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-479-roots-on-the-rise"}}},{"node":{"challenge":{"fields":{"slug":"/learn/coding-interview-prep/project-euler/problem-480-the-last-question","blockName":"Project Euler"},"id":"5900f54c1000cf542c51005f","block":"project-euler","challengeType":5,"title":"Problem 480: The Last Question","order":4,"superBlock":"coding-interview-prep","dashedName":"problem-480-the-last-question"}}}]}},"pageContext":{"certification":"coding-interview-prep","superBlock":"coding-interview-prep","slug":"/learn/coding-interview-prep/"}},
    "staticQueryHashes": ["3851966407","3877153394"]}