Lowes India Hiring Codeathon

where’s the code?

Wrote it during the contest It passed 5 tc but giving MLE in rest even though the dp array is 10e5

It may be due to too many recursion calls.

Yes maybe but then I wrote the tabular dp that too gave MLE in 5 tc

Ooooh okay , Thank you so much!

did anyone got selected for interview round?

1 Like

No, Despite doing both question (full marks) they didn’t selected for interview round, I don’t know what they are looking for. I am DTU student 2022 batch.


That’s not fair. I think you should be called for interview round.


They should not have wasted our time if they only wanted students from iits and nits for the interview. Seems like it was a PR stunt by them to let everyone take the test.


Shame on Lowe’s India.


I have solved both the questions and got 200/200 but still get rejected.

1 Like

IT IS JUST RIDICULOUS !! In the end, they were only looking for IITians …

Nope its not true.

Same bro xD

How’s that possible?? Why a 200 scoring candidate is rejected and the confusing part is its just coding and nothing else to segregate !!

Actually I am from NIT, so i can give u all an idea
Me and some of my friends submitted the test at evening around 6-7 pm, 1.5/2
And a guy submitted 1/2 in the early morning around 8-9am, he got an interview call… but not us

@venk_22 , i gave my test around 9:45 a.m and solving 1 question full and 2nd question 1 tc passed. Still i got rejection mail. Why is it so?

I think they are considering more factors.
May be scores of first round. Also people who had given both tests (Data analyst one also) might have got because of it.

Are results for Analyst position also announced?

Any guys who cleared the first round of Lowes India Hiring challenge on Hacker earth Please Help me with these coding questions .
Question 1) (Based on Graphs)
1)We are given an undirected graph with no edge weights and each node is numbered from 1 to n .Each node contains a value which will be given as a separate array with 1-based indexing. There are two players and they play with this graph using following rules:
1)Player1 selects one node and removes that node including the edges connected to it in order to break it into two or more parts.
2)Now ,Player2 now selects the connected component of the graph such that the sum of all values in the nodes of selected component is maximum.
3)Now, Player1 selects the connected component from the remaining connected components .
Scores of each player is the sum of values at all nodes of the connected component of graph which was selected by them and each player wants to maximize his/her score .Assume each player optimally.
we need to output the scores of player1 and player2.

Question 2) (Based on Trees)
In this question we are given a binary tree in which some nodes are colored in white and some nodes in black color.We can color the given tree by following the below rules:
1)We can color only white nodes means only the white nodes from the given tree can be converted in to black nodes. Reverse in not possible.
2)We can color any white node in to black node if and only if the parent of white node is a black node.
Using above mentioned rules we have to find the number of different possible trees which can be obtained by coloring the given tree using the above rules.

If there are any similar problems of this type please share them with me.
Thank You :slight_smile: