Describe a routine which returns the set of integers in {1..100} divisible without remainder by 3 but not by 9.
76 Domande di colloqui condivise dai candidati | ruby software engineer
This was a pair programming session with a Ruby engineer. They allow you to use your own laptop which was great but you only get 30 minutes to finish the problem with working unit tests. I think they re-use this pair programming problem so I'm not going to divulge details here. But it wasn't a particularly hard problem, they just want you to see how you code and test. Do not forget to write unit tests! Ideally you would develop it in a TDD fashion.
OOPS, REST, SOAP, minor questions regarding rails security, rspec, AWS and some third party concepts.
Why did you apply for the position?
for my experience, my knowledge
The asked what my plans for the future are
Voce recebeu 2 notificações, uma de seu chefe, pedindo para ligar pra ele, uma do CEO da empresa pedindo para ligar pra ele e um email da sua assistente pedindo para ligar pra ela, em qual ordem você responde?
Covered a lot of ground... Git, SQL, Ruby, privacy, and some of the usual behavioral ones.
Do you want to develop in Kotlin?
Write a program that prints a multiplication matrix/table of the first N prime numbers. Generate the primes yourself, think about complexity and how the code scales.
Stai visualizzando 1 - 10 domande di colloquio