Rosetta Code
Offered By: freeCodeCamp
Course Description
Overview
- Rosetta Code Challenges
Syllabus
- 100 doors
- 24 game
- 9 billion names of God the integer
- ABC Problem
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Align columns
- Amicable pairs
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Babbage problem
- Balanced brackets
- Circles of given radius through two points
- Closest-pair problem
- Combinations
- Comma quibbling
- Compare a list of strings
- Convert seconds to compound duration
- Count occurrences of a substring
- Count the coins
- Cramer's rule
- Cumulative standard deviation
- CUSIP
- Cut a rectangle
- Date format
- Date manipulation
- Day of the week
- Deal cards for FreeCell
- Deepcopy
- Define a primitive data type
- Department Numbers
- Discordian date
- Dot product
- Element-wise operations
- Emirp primes
- Entropy
- Equilibrium index
- Ethiopian multiplication
- Euler method
- Evaluate binomial coefficients
- Execute a Markov algorithm
- Execute Brain****
- Extensible prime generator
- Factorial
- Factors of a Mersenne number
- Factors of an integer
- Farey sequence
- Fibonacci n-step number sequences
- Fibonacci sequence
- Fibonacci word
- FizzBuzz
- Fractran
- Gamma function
- Gaussian elimination
- General FizzBuzz
- Generate lower case ASCII alphabet
- Generator/Exponential
- Gray code
- Greatest common divisor
- Greatest subsequential sum
- Hailstone sequence
- Happy numbers
- Harshad or Niven series
- Hash from two arrays
- Hash join
- Heronian triangles
- Hofstadter Figure-Figure sequences
- Hofstadter Q sequence
- I before E except after C
- IBAN
- Identity matrix
- Iterated digits squaring
- Jaro distance
- JortSort
- Josephus problem
- K-d tree
- Kaprekar numbers
- Knapsack problem/0-1
- Knapsack problem/Bounded
- Knapsack problem/Continuous
- Knapsack problem/Unbounded
- Knight's tour
- Largest int from concatenated ints
- Last letter-first letter
- Last Friday of each month
- Leap year
- Least common multiple
- Left factorials
- Letter frequency
- Levenshtein distance
- Linear congruential generator
- Long multiplication
- Longest common subsequence
- Longest increasing subsequence
- Longest string challenge
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- LU decomposition
- Lucas-Lehmer test
- Ludic numbers
- Luhn test of credit card numbers
- Lychrel numbers
- LZW compression
- S-Expressions
- Sailors, coconuts and a monkey problem
- Search a list of records
- SEDOLs
- Self Describing Numbers
- Self-referential sequence
- Semiprime
- Set consolidation
- Set of real numbers
- SHA-1
- SHA-256
- Sort an array of composite structures
- Sort disjoint sublist
- Sort stability
- Sort using a custom comparator
- Sorting algorithms/Bead sort
- Sorting algorithms/Bogosort
- Sorting algorithms/Cocktail sort
- Sorting algorithms/Comb sort
- Sorting algorithms/Gnome sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Shell sort
- Sorting algorithms/Stooge sort
- Sorting algorithms/Strand sort
- Soundex
- Spiral matrix
- Split a character string based on change of character
- State name puzzle
- Stern-Brocot sequence
- Straddling checkerboard
- Stream Merge
- Strip control codes and extended characters from a string
- Subleq
- Sudoku
- Sum digits of an integer
- Sum multiples of 3 and 5
- Sum of a series
- Sum of squares
- Sum to 100
- Sutherland-Hodgman polygon clipping
- Symmetric difference
- Taxicab numbers
- Tokenize a string with escaping
- Topological sort
- Top rank per group
- Towers of Hanoi
- Vector cross product
- Vector dot product
- Word frequency
- Word wrap
- Y combinator
- Zeckendorf number representation
- Zhang-Suen thinning algorithm
- Zig-zag matrix
Taught by
freeCodeCamp Team
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera