Started off with Phone Screen:

1. Given a list of token values, and a totalValue that needs to be reached, find the minimum number of tokens needed to reach this totalValue. Asked for an alternative approach once I solved it 1 way.
2. Given a list of animal weights and a max number of trips to take with a vehicle, find the minimum weight of the vehicle so that it can transport all the animals within the given timeframe.

Onsite:
2 coding, 1 behavioral

Behavioral: Pretty standard questions. Resume deep dive, tell me about a time when type questions.

Coding:

1. There are several cards arranged in a row, and each card has associated number of points. In one step you can take 1 card from beginning or end of row. You need to take k cards, score is sum of points of cards taken. Given list of cardpoints and integer k, return max score you can obtain.
2. Given list of heights represeting heights of buildings, some bricks, and some ladders, start from building 0 and then move to the next building by posibly using bricks or ladders. While moving to the next building, if current buildings height >= the next one's don't need a ladder or bricks. if it's less than the next ones, use 1 ladder or h[i+1]-h[i] bricks. return furthest building index you can reach if you use the bricks and ladders optimally.

Questions 3 and 4 were directly taken from TikTok tagged questions.

I did well but ultimatley got rejected.