Applied and next day received a hacker rank. SQL easy, BUT LEETCODE MEDIUM Required depth first search of an acyclic directed graph, and minimize the required changes so that a condition could be met. SQL took me like 8 min but the LEETCODE one I couldn't get right. Code complied and all but didn't pass the test cases and timed out for some. Hadn't seen or practiced a tree traversal question in years much less one that combined trees with minimization problems

OA has 1 sql question and 1 python question, both easy, administed via hackerrank, may be through another one though as well. you are given 60 mins to complete the OA portion of the interview process