Lowes India Hiring Codeathon

1

Any idea when the results will be announced?

1 Like
2

I think the results were announced just a few minutes back.

I have got a question guys!

The mail doesn’t state any reference about what is the Start Date, Time and End Date, Time, how ever mail contains link to attempt the test.

So before what date should we go for it?

Also, what was your score for which you have qualified?

4

mine was 150, what was yours?

5

I received 2 emails one for Associate software Engineer (test time - 19 Jun 6 AM onwards), another is for (Associate Analyst (test time - 20 Jun 6 AM onwards). My score was around 150. :slightly_smiling_face:

6

How can i check my score…?

7

How can i check my score…? Plz tell me

8

Does anyone know when will they announce the results of the 2nd round?

9

what was your score in 2nd round?

10

Since the test has ended, can someone with a full score in the Bridge problem share his approach?

1 Like
11

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
12

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
13

eeh…, now it is more clear, thanks @karan_221 and @spyder101

2 Likes
14

Can you tell me how to solve the first problem, ‘Yet another subset problem’?

2 Likes
15

@mkitkat @spyder101 @karan_221
What were your scores?
I wrote naive solutions to both problems and passed 1/2 testcases in both

16

hey how u get to know about openings i.e when to apply, i always miss these oppurtunities

17

how many solved both questions fully ?

18

shouldn’t it’s complexity be O(mlogn) as there are m ranges ?

19

Please share the code for Name Game problem.

20

Apparently there also exist an elegant priority queue solution. I don’t know much about it.

21

@spyder101 Did you receive any mail regarding the interview process. Or did anyone got mail that they have been qualified.