https://wiki.haskell.org/H-99:_Ninety-Nine_Haskell_Problems
- Find the last element of a list.
- Find the last but one element of a list.
- Find the K'th element of a list. The first element in the list is number 1.
- Find the number of elements of a list.
- Reverse a list.
- Find out whether a list is a palindrome. A palindrome can be read forward or backward; e.g. (x a m a x).
- Flatten a nested list structure.
- Eliminate consecutive duplicates of list elements.
- Pack consecutive duplicates of list elements into sublists. If a list contains repeated elements they should be placed in separate sublists.
- Run-length encoding of a list
- Run-length encoding of a list modified
- Decode a run-length encoded list.
- Run-length encoding of a list (direct solution).
- Duplicate the elements of a list.
- Replicate the elements of a list a given number of times.
- Drop every N'th element from a list.
- Split a list into two parts; the length of the first part is given.
- Extract a slice from a list.
- Rotate a list N places to the left.
- Remove the K'th element from a list.
- Insert an element at a given position into a list.
- Create a list containing all integers within a given range.
- Extract a given number of randomly selected elements from a list.
- Lotto: Draw N different random numbers from the set 1..M.
- Generate a random permutation of the elements of a list.
- Generate the combinations of K distinct objects chosen from the N elements of a list
- Group the elements of a set into disjoint subsets.
- Sorting a list of lists according to length of sublists
- Determine whether a given integer number is prime.
- Determine the greatest common divisor of two positive integer numbers. Use Euclid's algorithm.
- Determine whether two positive integer numbers are coprime. Two numbers are coprime if their greatest common divisor equals 1.
- Calculate Euler's totient function phi(m).
- Determine the prime factors of a given positive integer. Construct a flat list containing the prime factors in ascending order.
- Determine the prime factors of a given positive integer. Construct a list containing the prime factors and their multiplicity.
- Calculate Euler's totient function phi(m) (improved)
- A list of prime numbers.
- Goldbach's conjecture.
- Given a range of integers by its lower and upper limit, print a list of all even numbers and their Goldbach composition.
- and 47 Define predicates and/2, or/2, nand/2, nor/2, xor/2, impl/2 and equ/2 (for logical equivalence) which succeed or fail according to the result of their respective operations; e.g. and(A,B) will succeed, if and only if both A and B succeed.
- Gray codes.
- Huffman codes.