"Nobody tells people who are beginners" ~ IRA GLASS
Ira Glass's advice for beginners:
In the following video, Ira Glass explains the above presentation:
Gist: Computing Powerset with Scala
Given a set represented as a String, we can compute its powerset using foldLeft, as shown below.
def powerset(s: String) =
s.foldLeft(Set("")) {
case (acc, x) => acc ++ acc.map(
Scala Hacking: Computing min and max of a List
There are several ways to accomplish this. Next code snippet shows how to compute min and max using reduceLeft.
val ls = List(1,2,3,4,5)
ls.reduceLeft(_ min _) // is equivalent to
Constructing a balanced Binary Search Tree from a sorted List in O(N) time
This post discusses a O(n) algorithm that construct a balanced binary search tree (BST) from a sorted list. For instance, consider that we are given a sorted list: [1,2,3,4,
LeetCode OJ: Reverse Words in a String
Following is a simple solution to the LeetCode's Reverse Words in a String problem.
def reverseWords(s: String) =
s.split (" ")
.reverse
.mkString(" ")
Lets execute it in the