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. Practice
  2. Functional Programming
  3. Ad Hoc
  4. Remove Duplicates
  5. Discussions

Remove Duplicates

Sort 9 Discussions, By:

votes

  • dmytrolypai + 1 comment

    This is the same problem as in String Reductions under the Recursion subdomain, or am I missing something? Thanks!

    • AbhishekVermaIIT + 0 comments

      Correct ! Same problem ... with easier test cases !

  • dhirajhimani + 1 comment
    println(scala.io.StdIn.readLine().foldLeft("")((acc:String , x) => if (acc.contains(x)) acc else acc + x))
    • dhirajhimani + 0 comments

      For simplicity it could had been println(scala.io.StdIn.readLine().distinct) :D

  • marianomacchi + 0 comments

    Clojure

    Using recursion:

    (defn remove-duplicates [input-string seen]
        (if (not (empty? input-string))
            (let [current-char (first input-string)]
                (if (.contains seen (str current-char)) 
                    (remove-duplicates (rest input-string) seen)
                    (remove-duplicates (rest input-string) (str seen current-char))))
            seen))

(println (remove-duplicates (read-line) ""))

    Note: from clojure 1.9, contains can be replaced with clojure.string/includes?

    Using built-in functions:

    (println (apply str (distinct (read-line)))

  • shalini_chavan05 + 0 comments
    let dup list=  
       match list with
       |[] -> []
       |head :: tail -> List.fold (fun op head -> if List.contains head op then op else head :: op )[head] tail
       |> List.rev 

let result = dup (List.ofSeq str)
let op = System.String.Concat(Array.ofList(result))
printfn "%s" op

  • alexprut + 0 comments

    This problem is a duplicate of https://www.hackerrank.com/challenges/string-reductions/problem

Load more conversations