Nice!! For optimizing part 2, I would use a set! O(1) to check if an item is in it!
Aha! Thanks so much, it's blazingly fast now:
let rec addFreqWithState acc visited whole remaining = match remaining with | [] -> addFreqWithState acc visited whole whole | head::tail -> let newval = acc + head if Set.contains newval visited then newval else addFreqWithState newval (Set.add newval visited) whole tail let day1Part2 fileName = let freqs = getFrequencies fileName addFreqWithState 0 (new Set<int> (Seq.empty)) freqs freqs
I guess the Tour of F# page shouldn't be my only learning resource :)
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Nice!! For optimizing part 2, I would use a set! O(1) to check if an item is in it!
Aha! Thanks so much, it's blazingly fast now:
I guess the Tour of F# page shouldn't be my only learning resource :)