I applied online. I interviewed at Asana (San Francisco, CA) in Aug 2020
Interview
Leetcode type interview, followed by a more critical thinking game building scenario. Interviewer was helpful and they are looking for you to ask questions if you get stuck. Make sure you practice explaining your steps outloud.
I applied online. The process took 2 months. I interviewed at Asana in Feb 2021
Interview
I applied to Asana as soon as the process opened. Then I got a CodeSignal take home with 4 coding challenges. I solved 3 out of the 4 questions. Usually people that solves 1/4-2/4 gets to the next step. So I was excited about it. A week later I sent a follow up to the recruiter and she said she’d get back to me by the end of the week. Over a month later she sent me an e-mail saying that the role was filled and the process was closed. I asked her for a feedback since I did very well on my take home, I wanted to understand why I didn’t move forward. She said that it was more because of the volume of applications than my performance. So is this process a lottery? If the company can’t deal with that amount of applications why on earth they don’t close the application process before? Is it to show off how many people want to work for the company?
I hope a recruiter don’t bother to answer my review with “I’m sorry you had a bad experience, we’re working hard to make it better.” , since they didn’t bother to see my application and the results of my take home challenge. The most disrespectful process I’ve been through.
Interview questions [1]
Question 1
It’s been so long that I don’t even remember. I know it was 2 easy problems, 1 medium matrix problem and 1 hard problem. Just do leetcode and you’ll be fine.
I applied online. I interviewed at Asana (San Francisco, CA) in Aug 2020
Interview
I applied online and received a coding challenge. The challenged included 4 algorithm / data structure type problems. The problems were not too hard but had a lot of parameters and edge cases making getting points difficult.
Following this was a n
Interview questions [2]
Question 1
Given a square matrix of positive integers, sort the numbers in each of its diagonals parallel to the secondary diagonal.
Given two strings s and t, both consisting of lowercase English letters and digits, your task is to calculate how many ways exactly one digit could be removed from one of the strings so that s is lexicographically smaller than t after the removal.