I applied online. The process took 1+ week. I interviewed at IBM
Interview
I got an online screener for SWE, US Hackerrank. The screener was a mystery, with no real indication of what facet of ComSci you should be bringing with you. It was graph theory, I was rusty on that.
First question involves finding the minimum edges between all nodes in a connected graph. the second question involves building and traversing a bigraph. Paraphrased, of course.
You could probably do this in the allotted hour if you were familiar and fresh on the material.
Interview questions [1]
Question 1
The easiest analog I could wager would be a BFS of a bidirectional unweighted graph.