gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(meta): Move challenge meta to challenges root

Browse Source
This commit is contained in:
Bouncey
2018-10-09 20:27:30 +01:00
committed by mrugesh mohapatra
parent aa668ca30e
commit ee9f6b2d72
46 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
curriculum/challenges/english/08-coding-interview-prep/algorithms/meta.json
View File

@ -1,50 +0,0 @@
{
"name": "Algorithms",
"dashedName": "algorithms",
"order": 1,
"time": "",
"template": "",
"required": [],
"superBlock": "coding-interview-prep",
"superOrder": 8,
"challengeOrder": [
[
"a3f503de51cf954ede28891d",
"Find the Symmetric Difference"
],
[
"a56138aff60341a09ed6c480",
"Inventory Update"
],
[
"a7bf700cd123b9a54eef01d5",
"No Repeats Please"
],
[
"a3f503de51cfab748ff001aa",
"Pairwise"
],
[
"8d5123c8c441eddfaeb5bdef",
"Implement Bubble Sort"
],
[
"587d8259367417b2b2512c85",
"Implement Selection Sort"
],
[
"587d8259367417b2b2512c86",
"Implement Insertion Sort"
],
[
"587d825a367417b2b2512c89",
"Implement Quick Sort"
],
[
"587d825c367417b2b2512c8f",
"Implement Merge Sort"
]
],
"helpRoom": "HelpJavaScript",
"fileName": "08-coding-interview-prep/algorithms.json"
}

202
curriculum/challenges/english/08-coding-interview-prep/data-structures/meta.json
View File

@ -1,202 +0,0 @@
{
"name": "Data Structures",
"dashedName": "data-structures",
"order": 2,
"time": "",
"template": "",
"required": [],
"superBlock": "coding-interview-prep",
"superOrder": 8,
"challengeOrder": [
[
"587d8253367417b2b2512c6a",
"Typed Arrays"
],
[
"587d8250367417b2b2512c5e",
"Learn how a Stack Works"
],
[
"587d8250367417b2b2512c5f",
"Create a Stack Class"
],
[
"587d8250367417b2b2512c60",
"Create a Queue Class"
],
[
"587d8255367417b2b2512c74",
"Create a Priority Queue Class"
],
[
"587d8255367417b2b2512c75",
"Create a Circular Queue"
],
[
"8d1323c8c441eddfaeb5bdef",
"Create a Set Class"
],
[
"587d8253367417b2b2512c6b",
"Remove from a Set"
],
[
"8d1923c8c441eddfaeb5bdef",
"Size of the Set"
],
[
"587d8253367417b2b2512c6c",
"Perform a Union on Two Sets"
],
[
"587d8253367417b2b2512c6d",
"Perform an Intersection on Two Sets of Data"
],
[
"587d8254367417b2b2512c6e",
"Perform a Difference on Two Sets of Data"
],
[
"587d8254367417b2b2512c6f",
"Perform a Subset Check on Two Sets of Data"
],
[
"587d8254367417b2b2512c70",
"Create and Add to Sets in ES6"
],
[
"587d8254367417b2b2512c71",
"Remove items from a set in ES6"
],
[
"587d8255367417b2b2512c72",
"Use .has and .size on an ES6 Set"
],
[
"587d8255367417b2b2512c73",
"Use Spread and Notes for ES5 Set() Integration"
],
[
"8d5823c8c441eddfaeb5bdef",
"Create a Map Data Structure"
],
[
"587d825b367417b2b2512c8d",
"Create an ES6 JavaScript Map"
],
[
"587d825b367417b2b2512c8e",
"Create a Hash Table"
],
[
"587d8251367417b2b2512c61",
"Work with Nodes in a Linked List"
],
[
"587d8251367417b2b2512c62",
"Create a Linked List Class"
],
[
"587d8251367417b2b2512c63",
"Remove Elements from a Linked List"
],
[
"587d8251367417b2b2512c64",
"Search within a Linked List"
],
[
"587d8251367417b2b2512c65",
"Remove Elements from a Linked List by Index"
],
[
"587d8252367417b2b2512c67",
"Add Elements at a Specific Index in a Linked List"
],
[
"587d825a367417b2b2512c87",
"Create a Doubly Linked List"
],
[
"587d825a367417b2b2512c88",
"Reverse a Doubly Linked List"
],
[
"587d8256367417b2b2512c7a",
"Find the Minimum and Maximum Value in a Binary Search Tree"
],
[
"587d8257367417b2b2512c7b",
"Add a New Element to a Binary Search Tree"
],
[
"587d8257367417b2b2512c7c",
"Check if an Element is Present in a Binary Search Tree"
],
[
"587d8257367417b2b2512c7d",
"Find the Minimum and Maximum Height of a Binary Search Tree"
],
[
"587d8257367417b2b2512c7e",
"Use Depth First Search in a Binary Search Tree"
],
[
"587d8258367417b2b2512c7f",
"Use Breadth First Search in a Binary Search Tree"
],
[
"587d8258367417b2b2512c80",
"Delete a Leaf Node in a Binary Search Tree"
],
[
"587d8258367417b2b2512c81",
"Delete a Node with One Child in a Binary Search Tree"
],
[
"587d8258367417b2b2512c82",
"Delete a Node with Two Children in a Binary Search Tree"
],
[
"587d8259367417b2b2512c83",
"Invert a Binary Tree"
],
[
"587d8259367417b2b2512c84",
"Create a Trie Search Tree"
],
[
"587d825a367417b2b2512c8a",
"Insert an Element into a Max Heap"
],
[
"587d825b367417b2b2512c8b",
"Remove an Element from a Max Heap"
],
[
"587d825b367417b2b2512c8c",
"Implement Heap Sort with a Min Heap"
],
[
"587d8256367417b2b2512c77",
"Adjacency List"
],
[
"587d8256367417b2b2512c78",
"Adjacency Matrix"
],
[
"587d8256367417b2b2512c79",
"Incidence Matrix"
],
[
"587d825c367417b2b2512c90",
"Breadth-First Search"
],
[
"587d825d367417b2b2512c96",
"Depth-First Search"
]
],
"helpRoom": "HelpJavaScript",
"fileName": "08-coding-interview-prep/data-structures.json"
}

1934
curriculum/challenges/english/08-coding-interview-prep/project-euler/meta.json
View File

File diff suppressed because it is too large Load Diff

363
curriculum/challenges/english/08-coding-interview-prep/rosetta-code/meta.json
View File

@ -1,363 +0,0 @@
{
"name": "Rosetta Code",
"dashedName": "rosetta-code",
"order": 5,
"time": "",
"template": "",
"required": [],
"superBlock": "coding-interview-prep",
"superOrder": 8,
"challengeOrder": [
[
"594810f028c0303b75339acb",
"100 doors"
],
[
"5951e88f64ebf159166a1176",
"24 game"
],
[
"5949b579404977fbaefcd736",
"9 billion names of God the integer"
],
[
"594810f028c0303b75339acc",
"ABC Problem"
],
[
"594810f028c0303b75339acd",
"Abundant, deficient and perfect number classifications"
],
[
"594810f028c0303b75339ace",
"Accumulator factory"
],
[
"594810f028c0303b75339acf",
"Ackermann function"
],
[
"594810f028c0303b75339ad0",
"Align columns"
],
[
"5949b579404977fbaefcd737",
"Amicable pairs"
],
[
"594d8d0ab97724821379b1e6",
"Averages-Mode"
],
[
"594d966a1467eb84194f0086",
"Averages-Pythagorean means"
],
[
"594da033de4190850b893874",
"Averages-Root mean square"
],
[
"594db4d0dedb4c06a2a4cefd",
"Babbage problem"
],
[
"594dc6c729e5700999302b45",
"Balanced brackets"
],
[
"5951815dd895584b06884620",
"Circles of given radius through two points"
],
[
"5951a53863c8a34f02bf1bdc",
"Closest-pair problem"
],
[
"5958469238c0d8d2632f46db",
"Combinations"
],
[
"596e414344c3b2872167f0fe",
"Comma quibbling"
],
[
"596e457071c35c882915b3e4",
"Compare a list of strings"
],
[
"596fd036dc1ab896c5db98b1",
"Convert seconds to compound duration"
],
[
"596fda99c69f779975a1b67d",
"Count occurrences of a substring"
],
[
"59713bd26bdeb8a594fb9413",
"Count the coins"
],
[
"59713da0a428c1a62d7db430",
"Cramer's rule"
],
[
"59669d08d75b60482359409f",
"Date format"
],
[
"5966c21cf732a95f1b67dd28",
"Date manipulation"
],
[
"5966f99c45e8976909a85575",
"Day of the week"
],
[
"59694356a6e7011f7f1c5f4e",
"Deal cards for FreeCell"
],
[
"596a8888ab7c01048de257d5",
"Deepcopy"
],
[
"597089c87eec450c68aa1643",
"Define a primitive data type"
],
[
"59f40b17e79dbf1ab720ed7a",
"Department Numbers"
],
[
"59f4eafba0343628bb682785",
"Discordian date"
],
[
"599c333915e0ea32d04d4bec",
"Element-wise operations"
],
[
"599d0ba974141b0f508b37d5",
"Emirp primes"
],
[
"599d15309e88c813a40baf58",
"Entropy"
],
[
"5987fd532b954e0f21b5d3f6",
"Equilibrium index"
],
[
"599d1566a02b571412643b84",
"Ethiopian multiplication"
],
[
"59880443fb36441083c6c20e",
"Euler method"
],
[
"598de241872ef8353c58a7a2",
"Evaluate binomial coefficients"
],
[
"59e09e6d412c5939baa02d16",
"Execute a Markov algorithm"
],
[
"59e0a8df964e4540d5abe599",
"Execute Brain****"
],
[
"598ee8b91b410510ae82efef",
"Extensible prime generator"
],
[
"597b2b2a2702b44414742771",
"Factorial"
],
[
"598eea87e5cf4b116c3ff81a",
"Factors of a Mersenne number"
],
[
"597f1e7fbc206f0e9ba95dc4",
"Factors of an integer"
],
[
"59c3ec9f15068017c96eb8a3",
"Farey sequence"
],
[
"598eef80ba501f1268170e1e",
"Fibonacci n-step number sequences"
],
[
"597f24c1dda4e70f53c79c81",
"Fibonacci sequence"
],
[
"5992e222d397f00d21122931",
"Fibonacci word"
],
[
"5a7dad05be01840e1778a0d1",
"Fractran"
],
[
"5a23c84252665b21eecc7e76",
"Gamma function"
],
[
"5a23c84252665b21eecc7e77",
"Gaussian elimination"
],
[
"5a23c84252665b21eecc7e78",
"General FizzBuzz"
],
[
"5a23c84252665b21eecc7e7a",
"Generate lower case ASCII alphabet"
],
[
"5a23c84252665b21eecc7e7b",
"GeneratorExponential"
],
[
"5a23c84252665b21eecc7e80",
"Gray code"
],
[
"5a23c84252665b21eecc7e82",
"Greatest common divisor"
],
[
"5a23c84252665b21eecc7e84",
"Greatest subsequential sum"
],
[
"595608ff8bcd7a50bd490181",
"Hailstone sequence"
],
[
"594810f028c0303b75339ad1",
"Happy numbers"
],
[
"595668ca4cfe1af2fb9818d4",
"Harshad or Niven series"
],
[
"595671d4d2cdc305f0d5b36f",
"Hash from two arrays"
],
[
"5956795bc9e2c415eb244de1",
"Hash join"
],
[
"595b98f8b5a2245e243aa831",
"Heronian triangles"
],
[
"59622f89e4e137560018a40e",
"Hofstadter Figure-Figure sequences"
],
[
"59637c4d89f6786115efd814",
"Hofstadter Q sequence"
],
[
"5a23c84252665b21eecc7eb0",
"I before E except after C"
],
[
"5a23c84252665b21eecc7eaf",
"IBAN"
],
[
"5a23c84252665b21eecc7eb1",
"Identity matrix"
],
[
"5a23c84252665b21eecc7ec1",
"Iterated digits squaring"
],
[
"5a23c84252665b21eecc7ec2",
"Jaro distance"
],
[
"5a23c84252665b21eecc7ec4",
"JortSort"
],
[
"5a23c84252665b21eecc7ec5",
"Josephus problem"
],
[
"59da22823d04c95919d46269",
"Sailors, coconuts and a monkey problem"
],
[
"59d9c6bc214c613ba73ff012",
"SEDOLs"
],
[
"59667989bf71cf555dd5d2ff",
"S-Expressions"
],
[
"594ecc0d9a8cf816e3340187",
"Taxicab numbers"
],
[
"594faaab4e2a8626833e9c3d",
"Tokenize a string with escaping"
],
[
"594fa2746886f41f7d8bf225",
"Topological sort"
],
[
"595011cba5a81735713873bd",
"Top rank per group"
],
[
"5951ed8945deab770972ae56",
"Towers of Hanoi"
],
[
"594810f028c0303b75339ad2",
"Vector cross product"
],
[
"594810f028c0303b75339ad3",
"Vector dot product"
],
[
"594810f028c0303b75339ad4",
"Word wrap"
],
[
"594810f028c0303b75339ad5",
"Y combinator"
],
[
"594810f028c0303b75339ad6",
"Zeckendorf number representation"
],
[
"594810f028c0303b75339ad7",
"Zhang-Suen thinning algorithm"
],
[
"594810f028c0303b75339ad8",
"Zig-zag matrix"
]
],
"helpRoom": "",
"nChallenges": 437,
"fileName": "08-coding-interview-prep/rosetta-code.json"
}

94
curriculum/challenges/english/08-coding-interview-prep/take-home-projects/meta.json
View File

@ -1,94 +0,0 @@
{
"name": "Take Home Projects",
"dashedName": "take-home-projects",
"order": 4,
"time": "",
"template": "",
"required": [],
"superBlock": "coding-interview-prep",
"superOrder": 8,
"challengeOrder": [
[
"bd7158d8c442eddfaeb5bd10",
"Show the Local Weather"
],
[
"bd7158d8c442eddfaeb5bd19",
"Build a Wikipedia Viewer"
],
[
"bd7158d8c442eddfaeb5bd1f",
"Use the Twitch JSON API"
],
[
"bd7158d8c443edefaeb5bdee",
"Build an Image Search Abstraction Layer"
],
[
"bd7158d8c442eedfaeb5bd1c",
"Build a Tic Tac Toe Game"
],
[
"bd7158d8c442eddfaeb5bd1c",
"Build a Simon Game"
],
[
"bd7156d8c242eddfaeb5bd13",
"Build a Camper Leaderboard"
],
[
"bd7155d8c242eddfaeb5bd13",
"Build a Recipe Box"
],
[
"bd7154d8c242eddfaeb5bd13",
"Build the Game of Life"
],
[
"bd7153d8c242eddfaeb5bd13",
"Build a Roguelike Dungeon Crawler Game"
],
[
"bd7150d8c442eddfafb5bd1c",
"P2P Video Chat Application"
],
[
"bd7198d8c242eddfaeb5bd13",
"Show National Contiguity with a Force Directed Graph"
],
[
"bd7108d8c242eddfaeb5bd13",
"Map Data Across the Globe"
],
[
"bd7158d8c443eddfaeb5bd0f",
"Manage a Book Trading Club"
],
[
"bd7158d8c443eddfaeb5bdee",
"Build a Pinterest Clone"
],
[
"bd7158d8c443eddfaeb5bdff",
"Build a Nightlife Coordination App"
],
[
"bd7158d8c443eddfaeb5bd0e",
"Chart the Stock Market"
],
[
"bd7158d8c443eddfaeb5bdef",
"Build a Voting App"
],
[
"5a4b7fcdb66f799f199e11db",
"Build a Pong Game"
],
[
"5a5d02bd919fcf9ca8cf46cb",
"Build a Light-Bright App"
]
],
"helpRoom": "HelpFrontEnd",
"fileName": "08-coding-interview-prep/take-home-projects.json"
}