Alibaba

Software Engineer (Internship) Interview Experience

November 5, 2021

Positive ExperienceNo Offer

Process

The interviewer was nice and friendly, giving a reasonable amount of hints when I asked.

Even though I did not make it to the next round because I was not well prepared, the interviewer still gave suggestions for around 15 minutes.

Questions

First, the interviewer asked why I chose to switch majors and what interested me about working at Alibaba. Then, we went through my projects. After that, she asked two medium-level LeetCode questions.

Was this helpful?

Interview Statistics

The following metrics were computed from 5 interview experiences for the Alibaba Software Engineer (Internship) role in United States.

Success Rate

60%

Pass Rate

Alibaba's interview process for their Software Engineer (Internship) roles in the United States is on the easier side as most engineers get an offer after going through it.

Experience Rating

Positive80%

Neutral20%

Negative0%

Candidates reported having very good feelings for Alibaba's Software Engineer (Internship) interview process in United States.

Alibaba Work Experiences

Good Balance, Frequent On-calls

Software Engineer (SWE II) • Former Employee

Hangzhou, Zhejiang, China

Pros: Nice work-life balance (depends on the team, though).

Cons: frequent on-calls during the night

Good Balance, Frequent On-calls

Software Engineer (SWE II) • Former Employee

Hangzhou, Zhejiang, China

Pros: Nice work-life balance (depends on the team, though).

Cons: frequent on-calls during the night

Great For Grads, Long Hours

Software Engineer • Current Employee

Hangzhou, Zhejiang, China

February 28, 2021

Pros: Good place to work at for graduates.

Cons: Working hours are too long.

Great For Grads, Long Hours

Software Engineer • Current Employee

Hangzhou, Zhejiang, China

February 28, 2021

Pros: Good place to work at for graduates.

Cons: Working hours are too long.

Great Colleagues, Hr Lacking

Backend Developer • Current Employee

Singapore, Singapore

Pros: Work-life balance, many excellent colleagues.

Cons: Low human resources efficiency and high peer pressure.

Great Colleagues, Hr Lacking

Backend Developer • Current Employee

Singapore, Singapore

Pros: Work-life balance, many excellent colleagues.

Cons: Low human resources efficiency and high peer pressure.

Good Balance, Frequent On-calls

Software Engineer (SWE II) • Former Employee

Hangzhou, Zhejiang, China

Pros: Nice work-life balance (depends on the team, though).

Cons: frequent on-calls during the night

4.0
Good Balance, Frequent On-calls
Software Engineer (SWE II) • Former Employee
Hangzhou, Zhejiang, China
June 13, 2024
Pros: Nice work-life balance (depends on the team, though).
Cons: frequent on-calls during the night

Great For Grads, Long Hours

Software Engineer • Current Employee

Hangzhou, Zhejiang, China

February 28, 2021

Pros: Good place to work at for graduates.

Cons: Working hours are too long.

4.0
Great For Grads, Long Hours
Software Engineer • Current Employee
Hangzhou, Zhejiang, China
February 28, 2021
Pros: Good place to work at for graduates.
Cons: Working hours are too long.

Great Colleagues, Hr Lacking

Backend Developer • Current Employee

Singapore, Singapore

Pros: Work-life balance, many excellent colleagues.

Cons: Low human resources efficiency and high peer pressure.

5.0
Great Colleagues, Hr Lacking
Backend Developer • Current Employee
Singapore, Singapore
May 26, 2021
Pros: Work-life balance, many excellent colleagues.
Cons: Low human resources efficiency and high peer pressure.

Alibaba Interview Questions

Path Sum IV

You are given a list of three-digit integers representing a binary tree's structure and node values. Calculate the sum of all paths from the root to the leaves in this tree.

Split Array with Equal Sum

Given an array of integers, determine if it's possible to split it into two non-empty subarrays with equal sums. The split point itself is not included in either subarray's sum.

Split Concatenated Strings

You are given a list of strings. Concatenate them to form a single string, then find the lexicographically largest string possible by splitting the concatenated string at any point and rejoining it.

StringsGreedy AlgorithmsArrays

Copyright © Taro