Reports:Tasks not implemented in Kotlin
If Kotlin is a language you like, or are interested in, please inform your fellow members of the Kotlin community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Kotlin. Please implement some if you can. If any tasks are not possible or too complex in Kotlin, they should not be on this list. To mark a task as such, add {{omit from|Kotlin}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
2
A
B
C
- Calkin-Wilf sequence
- Canny edge detector
- Canonicalize CIDR
- Catmull–Clark subdivision surface
- Chernick's Carmichael numbers
- Church numerals
- Colorful numbers
- Colour pinstripe/Printer
- Compare length of two strings
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Consecutive primes with ascending or descending differences
- Cullen and Woodall numbers
- Curzon numbers
- Cyclops numbers
D
E
F
L
M
- Magic constant
- Magnanimous numbers
- Matrix digital rain
- Mayan calendar
- Mayan numerals
- Merge and aggregate datasets
- Mertens function
- Minesweeper game
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minkowski question-mark function
- Modified random distribution
- Motzkin numbers
- Multi-base primes
- Mutex
N
P
- P-Adic numbers, basic
- P-Adic square roots
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindromic gapful numbers
- Particle fountain
- Partition function P
- Peano curve
- Pell numbers
- Periodic table
- Peripheral drift illusion
- Pig the dice game/Player
- Pinstripe/Printer
- Pisano period
- Play recorded sounds
- Primality by Wilson's theorem
- Prime triangle
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/Splitmix64
R
- RCRPG
- Ramanujan's constant
- Ramanujan primes/twins
- Random sentence from book
- Rendezvous
- Repunit primes
- Retrieve and search chat history
- Rhonda numbers
- Rosetta Code/Count examples
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by number of users
- Ruth-Aaron numbers
S
- SHA-256 Merkle tree
- Same fringe
- Search in paragraph's text
- Selectively replace multiple instances of a character within a string
- Set right-adjacent bits
- Sierpinski arrowhead curve
- Sierpinski square curve
- Simple turtle graphics
- Sleeping Beauty problem
- Smallest number k such that k+2^m is composite for all m less than k
- Smarandache prime-digital sequence
- Sort an outline at every level
- Square form factorization
- Strassen's algorithm
- Suffixation of decimal numbers
- Sum of elements below main diagonal of matrix
- Summarize primes
- Sylvester's sequence
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 Kotlin (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
- Camel case and snake case
- Change e letters to i in words
- Changeable words
- Checksumcolor
- Chess player
- Code Golf: Code Golf
- Collect and sort square numbers in ascending order from three lists
- Common list elements
- Common sorted list
- Compiler/Preprocessor
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Concatenate two primes is also prime
- Conjugate a Latin verb
- Coprime triplets
- Coprimes
- Count how many vowels and consonants occur in a string
- Count the coins/0-1
- Cousin primes
- Create your own text control codes
- Cross compilation
- Cubic special primes
- Curve that touches three points
- Cycles of a permutation
D
- Dating agency
- Day of the week of Christmas and New Year
- Digit fifth powers
- Diophantine linear system solving
- Discrete Fourier transform
- Distinct palindromes within decimal numbers
- Distinct power numbers
- Distribution of 0 digits in factorial series
- Divide a rectangle into a number of unequal triangles
- Dominoes
- Doomsday rule
- Doubly-linked list/Element removal
E
F
- Fibonacci matrix-exponentiation
- Find adjacent primes which differ by a square integer
- Find first missing positive
- Find minimum number of coins that make a given value
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find square difference
- Find squares n where n+1 is prime
- Find words which contain the most consonants
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words whose first and last three letters are equal
- Find words with alternating vowels and consonants
- First 9 prime Fibonacci number
- Four sides of square
- Frobenius numbers
G
I
L
- Largest difference between adjacent primes
- Largest five adjacent number
- Largest palindrome product
- Largest prime factor
- Largest product in a grid
- Last list item
- Launch rocket with countdown and acceleration in stdout
- Long stairs
- Longest palindromic substrings
- Longest substrings without repeating characters
M
N
- N-queens minimum and knights and bishops
- Native shebang
- Neighbour primes
- Next special primes
- Nimber arithmetic
- Number triplets game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
O
P
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Parse EBNF
- Permutations with some identical elements
- Permuted multiples
- Piprimes
- Polynomial derivative
- Positive decimal integers with the digit 1 occurring exactly twice
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes with digits in nondecreasing order
- Print itself
- Process SMIL directives in XML data
- Proof
- Pseudorandom number generator image
R
- Ramanujan primes
- Range modifications
- Raster bars
- Recursive descent parser generator
- Red black tree sort
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance calculator
- Resistance network calculator
- Reverse the order of lines in a text file while preserving the contents of each line
- Rodrigues’ rotation formula
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Round-robin tournament schedule
- Run as a daemon or service
S
- Safe and Sophie Germain primes
- Safe mode
- Sanitize user input
- Segmentation fault protection
- Shift list elements to left by 3
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski curve
- Simulated annealing
- Smallest enclosing circle problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Solve equations with substitution method
- Solve hanging lantern problem
- Solving coin problems
- Sort primes from list to a list
- Sort the letters of string in alphabetical order
- Special divisors
- Special neighbor primes
- Special pythagorean triplet
- Starting a web browser
- Steady squares
- Strange unique prime triplets
- Substring primes
- Sum data type
- Sum of first n cubes
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of two adjacent numbers are primes
- Summation of primes
- Sunflower fractal
T
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Kotlin, 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 Kotlin 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 Kotlin 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.