An anagram is a rearrangement of letters in a word to produce another word, eg. spar becomes rasp. Find the steps to transform this anagram; eg spar -> spra -> srpa -> rspa -> rsap -> rasp.
There may be multiple solutions to each rearrangement (depending on where you start, for example).
Test cases in Scala
assert(alignPosition("THE EYES", "THEY SEE", 0) == Nil) assert( alignPosition("THE EYES", "THEY SEE", 3) == List("THE EYES", "THE YEES", "THEY EES") ) assert( computeSwaps("spar", "rasp").toList.flatten == List("spar", "spra", "srpa", "rspa", "rsap", "rasp") ) assert( computeSwaps("THE EYES", "THEY SEE").toList.flatten == List("THE EYES", "THE YEES", "THEY EES", "THEY ESE", "THEY SEE") )
Algorithm in Scala
32 lines of Scala (compatible versions 2.13 & 3.0), showing how concise Scala can be!
One approach to this is to split this into two functionalities: to align individual positions (eg find the steps to move the r in spar to front), and then to iterate through with this function over the whole string to the end.
Computing the swaps is done using scanLeft, which is more or less Scala's way of doing a while-loop. (this is © from www.scala-algorithms.com)
We collect all these alignments, and this gives us our final result.
Scala concepts & Hints
The 'Option' type is used to describe a computation that either has a result or does not. In Scala, you can 'chain' Option processing, combine with lists and other data structures. For example, you can also turn a pattern-match into a function that return an Option, and vice-versa!
Pattern matching in Scala lets you quickly identify what you are looking for in a data, and also extract it.
(1 to n)syntax produces a "Range" which is a representation of a sequence of numbers.
scanLeft and scanRight
Scala's `scan` functions enable you to do folds like foldLeft and foldRight, while collecting the intermediate results
Stack safety is present where a function cannot crash due to overflowing the limit of number of recursive calls.
This function will work for n = 5, but will not work for n = 2000 (crash with java.lang.StackOverflowError) - however there is a way to fix it :-)
In Scala Algorithms, we try to write the algorithms in a stack-safe way, where possible, so that when you use the algorithms, they will not crash on large inputs. However, stack-safe implementations are often more complex, and in some cases, overly complex, for the task at hand.
.viewsyntax creates a structure that mirrors another structure, until "forced" by an eager operation like .toList, .foreach, .forall, .count.