We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Functional Programming
  3. Recursion
  4. String Reductions
  5. Discussions

String Reductions

Sort by

recency

|

43 Discussions

|

  • chandlerbrlw
     + 0 comments

    Here is my haskell solution.

    reduceStr = reverse . foldl (\acc e -> if e `elem` acc then acc else e : acc) []
main = getLine >>= putStr . reduceStr

  • willddy
     + 0 comments

    scala

    print(readLine().toList.to(collection.mutable.LinkedHashSet).mkString)

  • legolaslada
     + 0 comments

    Haskell

    main = interact $ nub

  • lematero
     + 0 comments

    f# solution

    open System

[<EntryPoint>]
let main _ =
    Console.ReadLine()
    |> Seq.toList
    |> List.distinct
    |> List.iter Console.Write

    0

  • nillbrade
     + 0 comments

    Always love to play with strings war. You can solve same problem with multiple solutions. I got that here.