Finding string pairs

	package pelssers.io
	import scala.collection.mutable.Map
	import scala.math.abs
	/** TASK DESCRIPTION
	Create a method that takes a string parameter and looks for pairs of strings in the code,
	breaking the string up using spaces as the delimiter.
	There are two types of pairs, combinations and adjacent, and you'll need to find a count of each.
	Adjacent pairs appear alongside each other, while combination pairs cover every permutation
	that can be found of pairing the strings.
	So if you have a string
	dzone java dzone dzone javascript java
	the results would be
	dzone has 1 adjacent pair
	dzone has 3 combination pairs (0,2) (0,3) (2,3)
	java has 1 combination pair (1,5)
	USAGE of solution:
	val theText = "dzone java dzone dzone javascript java"
	//> theText : String = dzone java dzone dzone javascript java
	StringPairFinder.printStringPairs(theText) //> java has 1 combination pair(s): (1,5)
	//| dzone has 1 adjacent pair(s)
	//| dzone has 3 combination pair(s): (0,2) (0,3) (2,3)
	**/
	object StringPairFinder {
	def toCombinations(text: String): Map[String, List[(Int,Int)]] = {
	val wordMap: Map[String, List[Int]] = new scala.collection.mutable.HashMap[String, List[Int]]
	for ((word,index) <- text.split(" ").zipWithIndex) {
	wordMap.update(word, wordMap.getOrElseUpdate(word, List()) :+ index)
	}
	val result = wordMap.map {
	case (key, positions) => (key, positions.combinations(2).toList.map(ele => (ele(0), ele(1))))
	}
	result.filter(!_._2.isEmpty)
	}
	def printStringPairs(text: String): Unit = {
	for ((key, pairs) <- toCombinations(text)) {
	val adjacent = (pairs.map {case (index1, index2) => if (abs(index1 - index2) == 1) 1 else 0}).sum
	if (adjacent > 0) println(s"$key has $adjacent adjacent pair(s)")
	println(s"$key has ${pairs.size} combination pair(s): " + pairs.mkString(" "))
	}
	}
	}

view raw gistfile1.scala hosted with ❤ by GitHub