letters = %w(A a b b c c c c d e)
letter_map = Hash.new(0)
letters.each do |letter|
letter_map[letter] += 1
end
def print_count(map)
map.each do |key, value|
puts "\"#{key}\": #{value}"
end
end
def match_count(map, count)
map.select { |key, value| value == count }.keys
end
print_count(letter_map)
match_count(letter_map, 4)https://www.penny-arcade.com/comic/2008/02/13/professor-layt...
Why are you always asking me to rediscover and reimplement the Fibonacci sequence when none of us give a fuck about it? This whole thing's insane, what have I become.
This is after the initial resume screen and sometimes even after they did an online leetcode style test.
Some took one look at it and walked out. Others would solve it in under a minute. Everyone in between.
There are lots and lots of big company jobs where you can skate by writing ~100 lines of code a week (or less!) all inside the mandated Big Company In-House Framework. In fact your boss demands that you work this way.
I mean, that was totally me for years, so I’m not judging too harshly.
I’ll still google “how 2 for loop” sometimes.
How would anyone know? Once a candidate fails the screen, the company rejects and never gives a second thought to the candidate again.
Does any company do follow-up to see what happened in the future to rejected candidates? I've never heard of that happening.
The coding screens are just assumed to be infallible, so the candidate must have been a fraud. It's unthinkable that the screening tests themselves are wrong, because then the whole hiring process is misguided.
Give me a function that given a number returns the letters that have that many in it. You have 60 minutes. Any language.