1-hour interview with Karat. 2 minutes introduce your technical background, 10 minutes on 3 easy time complexity questions (look at a short code snippet and explain time complexity), then 45 minutes on coding problems.
I got through 2 coding problems, the second one builds on the first.

1. word v is said to derive from word w if v can be obtained by rearranging the letters in w and adding one more letter (e.g. two -> wout). Given a list of vocabulary and a word w, return all words in the vocabulary that can be derived from w (either direct derivation or indirect derivation, so there can be intermediate steps between w and v)
2. Each word in the vocabulary has a value associated with it. Given (w, v), return the path whose sum of values are the largest.

Efficientcy is not a key concern as long as the code works on a small test set.