How can i check my score…? Plz tell me
Does anyone know when will they announce the results of the 2nd round?
what was your score in 2nd round?
Since the test has ended, can someone with a full score in the Bridge problem share his approach?
1 Like
u can use dp+lazy segment tree or dp +multiset to solve the problem dp[i] denotes the minimum cost till i index… in this way we can get 100 points…
2 Likes
Let dp[i] be the minimum score to construct the bridge completely up to ith section.
Initially dp[0] = 0 and dp[1 … n] = inf. Then process each team in sorted order.
If the current team can work on sections [L, R] then we can modify dp[R] in the following way:
dp[R] = min(dp[R], R - L + 1 + x)
where x = minimum value of dp[k] for L - 1 <= k < R
Naively x can be calculated in O(n) and in O(log n) using a segment tree.
Total complexity O(n log n) can pass the test cases.
The answer will be dp[n].
5 Likes
Can you tell me how to solve the first problem, ‘Yet another subset problem’?
2 Likes
@mkitkat @spyder101 @karan_221
What were your scores?
I wrote naive solutions to both problems and passed 1/2 testcases in both
hey how u get to know about openings i.e when to apply, i always miss these oppurtunities
how many solved both questions fully ?
shouldn’t it’s complexity be O(mlogn) as there are m ranges ?
Please share the code for Name Game problem.
Apparently there also exist an elegant priority queue solution. I don’t know much about it.
@spyder101 Did you receive any mail regarding the interview process. Or did anyone got mail that they have been qualified.
will you plz share your naive approach of first problem
Use TRIE the question would be solved.
Can someone send code for break the node.
no i didnt receive anything as of now