阿里北美面經

沒有太tricky的問題，主要就resume問了上一個實習的project and experience.
Coding Question:
Given an array of int, int k, int u, int l, calculate the total "score" of this array using the following rule:

First, sum up every k intervals of int in the array, and if sum < u, then score++, if sum > l, score--

Example: [0, 1, 2, 3, 4], k = 2, u = 2, l = 5.  0+1 = 1, score = 1, 1+2 = 3, score = 1,  2 + 3 = 5, score = 1, 3 + 4 = 7, score = 0;
Therefore, return 0;

蠻簡單的一個sliding window question, 感覺是leetcode easy 等級?

最後問了 c++ unordered_map vs map 的區別以及complexity



新手發文求大米!