I was being interviewed 4 hours ago and here it is.
Spoiler
The solution must be O(n) Time.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | tourist | 3755 |
| 3 | ecnerwala | 3696 |
| 4 | VivaciousAubergine | 3647 |
| 5 | ksun48 | 3629 |
| 6 | jiangly | 3616 |
| 7 | turmax | 3559 |
| 8 | strapple | 3486 |
| 9 | Kevin114514 | 3427 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
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.
The solution must be O(n) Time.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| 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) |
| Name |
|---|


