LISP

Erlang

Kotlin

Scala

Blogs

Explore All

S-99: Ninety-Nine Scala Problems

#21

P21 - Insert an element at a given position into a list.

Published on 27 Aug 2024

#22

P22 - Create a list containing all integers within a given range.

Published on 27 Aug 2024

#23

P23 - Extract a given number of randomly selected elements from a list.

Published on 27 Aug 2024

#24

P24 - Lotto: Draw N N different random numbers from the set 1.. M 1..M.

Published on 27 Aug 2024

#25

P25 - Generate a random permutation of the elements of a list.

Published on 27 Aug 2024

#26

P26 - Generate the combinations of K K distinct objects chosen from the N N elements of a list.

Published on 27 Aug 2024

#27

P27 - Group the elements of a set into disjoint subsets.

Published on 27 Aug 2024

#28

P28 - Sorting a list of lists according to length of sublists.

Published on 27 Aug 2024

#29

P29 - Sorting a list of lists according to length of sublists (1)

Published on 27 Aug 2024

#30

P30 - Sorting a list of lists according to length of sublists (2)

Published on 27 Aug 2024

#31

P31 - Determine whether a given integer number is prime.

Published on 27 Aug 2024

#32

P32 - Determine the greatest common divisor of two positive integer numbers.

Published on 27 Aug 2024

#33

P33 - Determine whether two positive integer numbers are coprime.

Published on 27 Aug 2024

#34

P34 - Calculate Euler’s totient function ϕ ( m ) ϕ(m).

Published on 27 Aug 2024

#35

P35 - Determine the prime factors of a given positive integer.

Published on 27 Aug 2024

#36

P36 - Determine the prime factors of a given positive integer (2).

Published on 27 Aug 2024

#37

P37 - Calculate Euler’s totient function ϕ ( m ) ϕ(m) (improved).

Published on 27 Aug 2024

#38

P38 - Compare the two methods of calculating Euler’s totient function.

Published on 27 Aug 2024

#39

P39 - A list of prime numbers.

Published on 27 Aug 2024

#40

P40 - Goldbach’s conjecture.

Published on 27 Aug 2024

S-99: Ninety-Nine Scala Problems

#21

P21 - Insert an element at a given position into a list.

#22

P22 - Create a list containing all integers within a given range.

#23

P23 - Extract a given number of randomly selected elements from a list.

#24

P24 - Lotto: Draw N N different random numbers from the set 1.. M 1..M.

#25

P25 - Generate a random permutation of the elements of a list.

#26

P26 - Generate the combinations of K K distinct objects chosen from the N N elements of a list.

#27

P27 - Group the elements of a set into disjoint subsets.

#28

P28 - Sorting a list of lists according to length of sublists.

#29

P29 - Sorting a list of lists according to length of sublists (1)

#30

P30 - Sorting a list of lists according to length of sublists (2)

#31

P31 - Determine whether a given integer number is prime.

#32

P32 - Determine the greatest common divisor of two positive integer numbers.

#33

P33 - Determine whether two positive integer numbers are coprime.

#34

P34 - Calculate Euler’s totient function ϕ ( m ) ϕ(m).

#35

P35 - Determine the prime factors of a given positive integer.

#36

P36 - Determine the prime factors of a given positive integer (2).

#37

P37 - Calculate Euler’s totient function ϕ ( m ) ϕ(m) (improved).

#38

P38 - Compare the two methods of calculating Euler’s totient function.

#39

P39 - A list of prime numbers.

#40

P40 - Goldbach’s conjecture.

Links

Links

Links