uvaprakashp Scala version
def f(n: Int) = println("Hello World\n" * n)
ufuoma_ighoroje1 better to avoid materializing big strings:
def f(n: Int) = Stream.fill(n)("Hello World") foreach {println}
patrick_ce Is mine functional or rather lame?
def f(n : Int) : Unit = { println("Hello World"); if (n > 1) f(n-1) }
m_venkatbeece You are using recursion, so in my opinion your's is more of a Functional style.
ramin_melikov Why not just:
def f(n :Int) = { for (i <- 1 to n) { print("Hello World\n") } }
italo_qualisoni Or inline:
def f(n: Int) =for (i <- 1 to n) println("Hello World")
ramin_melikov I do like what you did though. Nice and clean, without the "\n". Not what they teach in college :)
rorick Bad problem description for Clojure.
Description states to copy template and fill blank:
(fn[n]___________________________)But prepared caller part of solution is
(hello_word_n_times n)and is not editable. It will not compile if one copies template and fills blanks. Temlate must be(defn hello_word_n_times [n]___________________________)or(def hello_word_n_times (fn[n]___________________________)).BTW, there's also a misspelling in calling part that cannot be edited: word instead of wor**l**d.
I'm starting to suspect, that guys from Hackerrank do not really like Clojurists) Another surprise waiting Hackerrank student on his way of learning FP in Clojure is when his tested and submitted solution will fail with compile error. That's most likely because of version mismatch. Described environment is Clojure 1.9 and that is what anyone expects, but in reality it is ancient Clojure 1.6.
Katajam Thank you. I was trying hard to figure out the compile error as a person who never code in this language before...
ritchiey I agree.
It's brutal on beginners. It doesn't even show what my output is. It just says "Wrong output".
My function is
(defn hello_word_n_times [n] (apply str (interpose "\n" (take n (cycle ["Hello World"])))))Seems to work fine in other environments. Shame because the exercises are good.
alsuga Lang: Haskell
I'm learning haskell, if someone have a suggestion or a correction please let me knowhello_worlds 1 = putStrLn "Hello World" hello_worlds n = do putStrLn "Hello World" hello_worlds (n - 1) main = do n <- readLn :: IO Int hello_worlds n
sfelde21 what does this line do?
hello_worlds 1 = putStrLn "Hello World"
aleksei_maide I wasn't sure either (new to haskell), but apparently it's a stop condition. (If the input to the function is 1 then it simply does the following: putStrLn "Hello World")
0xb0b1 I think it's not the way you said "stop condition", it's a pattern matching for specifying which value the function should return for the given value, in this case: 1 But you're right about saying it simply does the following for 1. :)
ftreale Yes,
hello_worlds 1 = putStrLn "Hello World"is pattern matching. When thehello_wordsfunction is called with input 1, that is the executed line. However, in Haskell, the base of recursions are often expressed with a pattern match, so I think is fair to also say it's a stop condition.
Hertzz I've had many issues with this mostly bc of the function getManyLines that editor provides and I've ended up cutting it down to basicly your hello_worlds. It prints hello world ten times, and the editor is still saying the outpust is wrong. Also, shouldn't haskell functions be defined for all possible inputs? Does anybody have good sources for learning Haskell? turns out to be much more difficult then object oriented Langs
christopher_lil1 My version in Haskell:
hello_worlds n = mapM_ putStrLn $ replicate n "Hello World"
nitinradkeirctc mine is same hello_worlds n = mapM_ putStrLn (take n (repeat "Hello World"))
Edka Imparetive looking way to do it in Haskell:
hello_worlds n = forM_ [1..n] $ \_ -> putStrLn "Hello World"
xiang19950505 My version in Haskell:
import Control.Monad (replicateM_) hello_worlds :: Int -> IO () hello_worlds n = replicateM_ n $ putStrLn "Hello World"
Sort 103 Discussions, By:
Please Login in order to post a comment