Available Scala algorithm solutions
Check if an array is a palindrome in pure immutable Scala
Free
Count divisors algorithm in immutable/pure functional Scala
Free
Find an unpaired number in an array
Free
Balanced parentheses algorithm in immutable/pure functional Scala with tail-call recursion optimisation
Free
Count binary gap size of a number in immutable/pure functional Scala using tail recursion
Free
Find maximum potential profit from an array of stock prices - pure-functional immutable Scala solution
Free
Fizz Buzz in purely functional immutable Scala
Free
Check if a number is a palindrome in pure immutable Scala
$1.99
Compute maximum sum of subarray (Kadane's algorithm) in purely functional immutable Scala
$1.99
Find sub-array with the maximum sum
$1.99
Matching parentheses algorithm in immutable/pure functional Scala with foldLeft and a state machine
$1.99
Traverse a tree Breadth-First, immutably, and purely in Scala
$1.99
Count number of changes (manipulations) needed to make an anagram in immutable/pure
functional Scala with foldLeft and a MultiSet
$1.99
Check if a String is a palindrome in immutable Scala
$0.99
Traverse a tree Depth-First with purely-functional immutable Scala
$1.99
Count Factors of an integer in pure-functional immutable Scala
Coming soon