A recruiter reach out, he was great. Then the initial tech-interview came. I spoke to a (seemingly) junior engineer, who wouldn't stop talking long enough for me to think/code and gave me incorrect "hints". I will not reveal any details about the technical question asked, because if you are qualified to work there, you won't need the tip, just get a good night's sleep and eat a big breakfast (data structures and algorithms, blah, blah, get back to work). When the input to your algorithm is an array and you, iteratively, process it with a nested for-loop (where n == the length of the array), the run-time is O(N^2). But, when the input to your algorithm is an n-x-n matrix, and you use a nested for-loop to traverse it (where n == the height/width of that matrix (aka sqrt(n))), that run-time is O(n). I failed to complete the challenge, in the allotted time, and I regret that; I might not be ready to work with AWS. But my interviewer didn't seem to be convinced that there existed a situation where a nested for-loop could be O(n). Again, I recognize that not finishing the problem might be a legitimate reason not to hire me, but don't send people to hire cloud-dev engineers who don't understand basic math.