I was being interviewed 4 hours ago and here it is.
Spoiler
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Google | Phone Screen
I was being interviewed 4 hours ago and here it is.
Given an array A, that is a permutation of n numbers [1-n]. Find the number of subarrays S that meets the following condition max(S) - min(S) = length(S) - 1.
Example 1:
Input: [4, 3, 1, 2, 5]
Output: 10
Explanation: subarrays that meet the condition are
[4]
[3]
[1]
[2]
[5]
[4 3]
[1 2]
[3 1 2]
[4 3 1 2]
[4 3 1 2 5]
There are 10 subarrays that meet the condition, so the answer should be 10.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | Mike_Vernik | 2019-10-12 00:37:28 | 35 | Tiny change: 'oiler>\n\n \n' -> 'oiler>\n\nThe solution must be O(n) Time.\n \n' | ||
en1 | Mike_Vernik | 2019-10-12 00:36:51 | 693 | Initial revision (published) |
Название |
---|