Reports:Tasks not implemented in Racket
If Racket is a language you like, or are interested in, please inform your fellow members of the Racket community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Racket. Please implement some if you can. If any tasks are not possible or too complex in Racket, they should not be on this list. To mark a task as such, add {{omit from|Racket}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
B
C
- Calkin-Wilf sequence
- Canny edge detector
- Canonicalize CIDR
- Catmull–Clark subdivision surface
- Chaocipher
- Chernick's Carmichael numbers
- Circular primes
- Cistercian numerals
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Cyclotomic polynomial
D
E
F
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Fairshare between two and more
- Fermat numbers
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fixed length records
- Four is the number of letters in the ...
- French Republican calendar
I
L
M
- Magic squares of doubly even order
- Magic squares of singly even order
- Mastermind
- Mayan numerals
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Mian-Chowla sequence
- Mind boggling card trick
- Minimal steps down to 1
- Minkowski question-mark function
- Modified random distribution
- Monads/Writer monad
N
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindromic gapful numbers
- Pancake numbers
- Partition function P
- Peaceful chess queen armies
- Pell's equation
- Permutations/Rank of a permutation
- Pierpont primes
- Playfair cipher
- Primality by Wilson's theorem
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Xorshift star
R
S
- SHA-256 Merkle tree
- SOAP
- Safe primes and unsafe primes
- Self numbers
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sexy primes
- Sleeping Beauty problem
- Smarandache prime-digital sequence
- Sort an outline at every level
- Sorting algorithms/Cocktail sort with shifting bounds
- Spelling of ordinal numbers
- Square Form Factorization
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Super-d numbers
T
Draft tasks without implementation[edit]
These tasks are drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Racket (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.
A
B
C
- CLI-based maze-game
- Change e letters to i in words
- Changeable words
- Checksumcolor
- Chess player
- Combinations with repetitions/Square digit chain
- Common list elements
- Common sorted list
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Consecutive Primes With Ascending Or Descending Differences
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Coprime triplets
- Coprimes
- Count the coins/0-1
- Cousin primes
- Cubic Special Primes
- Curve that touches three points
D
F
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find first missing positive
- Find if a point is within a triangle
- Find prime n for that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words which contains most consonants
- Find words which first and last three letters are equals
- Find words with alternating vowels and consonants
- Frobenius numbers
G
L
M
N
- N-body problem
- Neighbour primes
- Next special primes
- Nice primes
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers which binary and ternary digit sum are prime
- Numbers with equal rises and falls
- Numbers with prime digits whose sum is 13
- Numerical integration/Adaptive Simpson's method
P
- Palindromic primes
- Parse EBNF
- Permutations with some identical elements
- Piprimes
- Pisano period
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime triplets
- Prime words
- Primes which sum of digits is 25
- Primes with digits in nondecreasing order
- Print itself
- Process SMIL directives in XML data
- Product of divisors
- Pseudo-random numbers/Splitmix64
- Pseudorandom number generator image
R
- Range modifications
- Raster bars
- Recursive descent parser generator
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Remove vowels from a string
- Resistance calculator
- Resistance network calculator
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
S
- Safe mode
- Self-hosting compiler
- Shift list elements to left by 3
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski arrowhead curve
- Sierpinski curve
- Sierpinski square curve
- Smallest enclosing circle problem
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Snake
- Solve a Rubik's Cube
- Solving coin problems
- Special Divisors
- Special factorials
- Spoof game
- Square root by hand
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- Strassen's algorithm
- Substring primes
- Sum data type
- Sum of divisors
- Sum of first n cubes
- Sum of the digits of n is substring of n
- Summarize primes
- Sylvester's sequence
T
U
V
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Racket, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.
Other pages[edit]
These are other pages related to Racket which require attention; with your knowledge and assistance, we can improve the quality of the site's content.
No pages found.
Not Considered[edit]
These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Racket was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
No pages found.
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
