Proof of concept for leftmostLongest function

test.hs

@@ -0,0 +1,5 @@
+leftmostLongest :: (Foldable t) => [t a] -> t a
+leftmostLongest xs = 
+        let lastElem = (last xs)
+            filteredLst = (filter (\val -> (length val) == (length lastElem)) xs)
+        in head filteredLst