DO NOT APPLY. DO NOT WASTE YOUR TIME. UNPROFESSIONAL.

They lie about offshore teams as well.

Met with a recruiter. She was nice and informative, giving a lot of clarity. Second call with the project manager. He was very professional, kind, down-to-earth, and friendly. He grilled me on every line of my resume to make sure I was a fit.

Third, a round of 4 interviews totaling about 4.5 hours was scheduled. EMBARRASSMENT.

They show up late to meetings.

In the technical interview, the interviewer was cold and uninterested. The HackerRank problem was about medium difficulty. He gave me the rest of the hour to finish it. I had written all the code and was confident that it worked by explaining it to him and coding it all out. At the end, it was clear that I had made an error somewhere since my test cases weren't passing. At this point, I was out of time, but I told him I was confident that I had the majority of the program correct and it would work. My first test case passed. The unprofessional interviewer just said 'ok bye'.

LOL, this is what happens when you put offshore developers in charge of trying to hire. Outdated hiring techniques.

They ask you for 10 different fields of expertise, then hold you to one HackerRank question. If you don't get all the test cases in the allotted time (that they show up late for), they scrap you. Yes, they canceled the rest of my interviews and didn't give me any follow-up email other than 'we will move forward'. What an embarrassment and extremely unprofessional.

I think any hiring manager that reads this needs to seriously reevaluate their hiring techniques. I can't imagine hiring someone solely based on their HackerRank test cases versus the other 100 things they have demonstrated they can do and match to the resume.

And yes, they have a lot of their engineers in India. Unless you want to work weekends and work alongside a team that is on the other side of the world (late nights), then do not apply for an engineering role in Austin!

In-depth resume questions:

Given an array of integers, find the highest occurring integer.

Given that there are multiple integers with the same maximum occurrences, determine the shortest substring within the original array where you will have the same amount of integers.

Return the shorter substring between those numbers.

Pretty simple, but could take a bit of code depending on the approach.