Category:BQN
BQN
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using BQN.
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
Execution method: | Compiled (bytecode) |
---|---|
Garbage collected: | Yes |
Parameter passing methods: | By value |
Type safety: | Safe |
Type checking: | Dynamic |
See Also: |
BQN is a new (initially released 2020) array oriented, functional programming language in the APL lineage, which aims to remove irregular and burdensome aspects of the APL tradition and put the great ideas on a firmer footing. While its use demands a solid understanding of functions and multidimensional arrays, BQN's focus on providing simple, consistent, and powerful array operations (and documentation!) makes it a good language for learning array programming and building stronger array intuition.
Documentation can be found at https://mlochbaum.github.io/BQN/doc/.
Todo
Pages in category "BQN"
The following 200 pages are in this category, out of 292 total.
(previous page) (next page)A
B
C
- Caesar cipher
- Calculating the value of e
- Calkin-Wilf sequence
- Call a function
- Cantor set
- Cartesian product of two or more lists
- Catalan numbers
- Catamorphism
- Change e letters to i in words
- Changeable words
- Character codes
- Check that file exists
- Chinese remainder theorem
- Classes
- Code Golf: Code Golf
- Collect and sort square numbers in ascending order from three lists
- Combinations
- Command-line arguments
- Comments
- Common list elements
- Common sorted list
- Compare a list of strings
- Compare length of two strings
- Conditional structures
- Conjugate a Latin verb
- Conway's Game of Life
- Coprimes
- Copy a string
- Count in octal
- Count occurrences of a substring
- Create a file
- Create a two-dimensional array at runtime
- Create an HTML table
- CSV data manipulation
- Currying
- CUSIP
- Cycle detection
D
- Damm algorithm
- Days between dates
- Delete a file
- Detect division by zero
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if a string is collapsible
- Determine if a string is numeric
- Determine if a string is squeezable
- Digit fifth powers
- Digital root
- Disarium numbers
- Distinct power numbers
- Dot product
- Dragon curve
E
F
- Factorial
- Factors of an integer
- Fibonacci n-step number sequences
- Fibonacci sequence
- File input/output
- Filter
- Find first missing positive
- Find limit of recursion
- Find words which contains all the vowels
- Find words whose first and last three letters are equal
- First-class functions
- FizzBuzz
- Flatten a list
- Forward difference
- Four sides of square
- Fractran
- Function composition
- Function definition
- Fusc sequence
G
H
I
L
- Lah numbers
- Langton's ant
- Largest five adjacent number
- Largest proper divisor of n
- Last list item
- Leap year
- Least common multiple
- Letter frequency
- Levenshtein distance
- Literals/Integer
- Logical operations
- Longest common prefix
- Longest common subsequence
- Longest common suffix
- Longest string challenge
- Longest substrings without repeating characters
- Look-and-say sequence
- Loops/Downward for
- Loops/Infinite
- Loops/While
- Luhn test of credit card numbers
M
- Magic squares of odd order
- Map range
- Matrix multiplication
- Matrix transposition
- Matrix with two diagonals
- Matrix-exponentiation operator
- McNuggets problem
- Miller–Rabin primality test
- Minimum number of cells after, before, above and below NxN squares
- Mosaic matrix
- Multifactorial
- Multiplication tables
- Munchausen numbers
- Munching squares
- Mutual recursion