This is a typical LC hard and LC medium question. I can't recall the exact details, but the hard one is a challenging graph problem that asks you to optimize it using a different approach presented in the problem. The medium problem is about finding a subset of a sum given an array.
Finding the subset of a specific sum given an array.
The following metrics were computed from 4 interview experiences for the ByteDance SWE Intern role in United States.
ByteDance's interview process for their SWE Intern roles in the United States is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for ByteDance's SWE Intern interview process in United States.