I applied online. I interviewed at Acorns (San Antonio, TX) in Apr 2021
Interview
Apply on Glassdoor, 13 day turnaround time
1 15-minute phone screening ->
1 Hackerank coding challenge ->
Panel Interview:
2 technical, each 1 hour,
1 behavioral, 30 minutes
5 business day turnaround time on decision
Interview questions [1]
Question 1
Hackerank: int to word (i.e. 32 -> thirty-two)
Technical 1: Clone a linked list with next and random pointer
Technical 2: int to roman numeral
Behavioral 1: Projects, past experience, motivations
I applied through an employee referral. The process took 3 weeks. I interviewed at Acorns (Irvine, CA) in Oct 2021
Interview
It was smooth. I had 4 rounds
- Initial phone Screening
- Take home CodePad challenges (Not an algorithm question)
- 2 1 hour - Tech screening (leetcode medium and easy) and 30mins behavioral
- 15 mins call with CEO
Then I was directed to a different team because the team I applied for was full. The whole process took 4 weeks but could have been faster if I didn't switch teams.
Everyone was so friendly and helpful! Never had an interview process so smooth and felt so encouraged after each step.
Be prepared to be able to talk about your code. Explain your steps and think out loud. Also, be ready to answer questions that are related to their values.
Interview questions [2]
Question 1
Given a target number and an array, find the locations of the 2 numbers in that array that adds up to the target number
I applied through an employee referral. I interviewed at Acorns in Apr 2021
Interview
First step: 20 minute phone screen with recruiter.
Second step: Online assessment. Was told it would be 60 minutes but website allowed for 120. Question was a Leetcode Hard.
Third Step: Final interviews. One hour technical, 30 minute behavioral, then another one hour technical. Problems were not very difficult but I was asked to follow up with different ways to solve or solving a variation of the problem.
Interview questions [2]
Question 1
Input is an array containing chars "n", "p", and "q". Output an array that sorts the chars (all the p's, then all the q's, then all the n's)
