Hello I'm trying to do a Haskell port of this excellent Python answer, more as an exercise than to actually post, and I'm having a bit of trouble: Try it online!

And it turns out I forgot my prelude. minimum

One of those days when you ask for help and figure it out not ten minutes later :D

Is there a way to save bytes by turning that x argument into a default argument x=1? Like defining a!b=(a#b)1 or something

@Sherlock9 39 bytes: (n#l)x|x<n=minimum$(n#l).(x*)<$>l|1>0=x

@Sherlock9 I don't think so

Hm, well I still need to do so, as there are only supposed to be two inputs n and l

@Sherlock9 Oh, right. Then this might be the best option: (#1);(l#x)n|x<n=minimum[(l#(x*e))n|e<-l]|1>0=x

@Laikoni Ah, thank you very much

Today I learned: In GHCI, the :t to display the type of a function can be golfed down to just :.

So many wasted ts ...

@Laikoni : does the last performed command. I often use it in place of :r

@H.PWiz Ohh, that's even better to know.

I only recently found out about the command: it

Yes, that is pretty useful too. I knew it because it is also present in Standard ML.

Anyone interested in some friendly competition on the speed of letters question?

I'm trying to get my solution below 100 bytes, but haven't posted anything yet.

I might give it a go, will take me a while though.

@Laikoni The best I have is 124 right now.

@H.PWiz I just found a way to do it in 88 bytes, after being stuck at 101 bytes before.

My method does not seem like it could be reduced much further, I have 117 now.

@Laikoni I recommend reading through :help every now and then:)

@flawr I think I had a look at :help quite some time ago, thought "That's a lot of commands I will probably never need" and forgot all about it.

I discover new stuff everytime:)

The best I can get is 112

@H.PWiz This my 88 byte solution: Try it online!.

Nice, this was mine

108

Aaand Zgarb left us both behind.

And also got three upvotes in under a minute, that's quick.