I am preparing for DE SHAW interview.if anyone has give DE SHAW code pair round , can you tell me what this round is all about , which type of question they ask , subjective or coding question . Thanks in advance
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
I am preparing for DE SHAW interview.if anyone has give DE SHAW code pair round , can you tell me what this round is all about , which type of question they ask , subjective or coding question . Thanks in advance
we are provided with n different range(l,r) and each range have value (val) associated with it . now we have given k query , in each query we have given one integer X , and we have to tell the minimum value we can obtain form the ranges in which X
lies i.e L<=x<=R , if their does not exist any range print -1 .
Input :
n — number of range .
next n line contain — ( l , r , val )
q — number of query.
next q line contain — (X)
output :
q — line with minimum value.
4
0 0 2
0 2 10
5 6 13
1 1 2
6
0
1
2
3
5
8
2
2
10
-1
13
-1
i am stuck with this dp problem , can any someone explain me the state of dp for this problem ? problem link is Question
Name |
---|