Linkedin internship test cutoff

56

that means u have solved 2 and 3rd complete.
have u attempted the optional section??

57

yuup and i think my optional questions was all correct because i have into webd with django

58

I think, people who attempted the optional section and solved min of 2 problems are more preferred than one who just solved 2 problems.

59

did you attempt the optional section

60

Hey Brother
I completed the first complete,2nd question 6 test cases passed and then completed all 3 questions in the optional.But I didn’t get any mail by now :frowning:

61

No, attempted only the coding section

62

did anyone else received the follow-up mail for interviews?

63

I think they are sending to those who have attempted optional section for full-stack role and for sde role they will send afterwards.

64

If they were to penalize people on grounds of the optional section, why call it optional in the first place?

1 Like
65

I solved the first one partial with 8 test cases and the rest two complete.
Also, I am sure of my all answers in the optional section.
Still haven’t received any follow-up mail. :slight_smile:
Should I expect any or consider myself to be unlucky.

66

Dont worry. I don’t think they will do such a thing. Maybe they are first selecting for UI developers and then for SDE post.

67

Might be possible that your mcqs were wrong and you are no longer considered for UI/full stack but you may still expect mail for SDE role

1 Like
68

Did anyone else get the mail ?

1 Like
70

Can u please share the problems?

71

  1. Given two integers A and B which represents the SUM and XOR of two numbers. Clearly,
    X + Y = A and X xor Y = B. You have to find the smallest value of the equation 2X+3Y.

  2. Given a matrix of ‘#’ and ‘.’. # of N*M represents there is a obstacle and ‘.’ represents path. Also given an integer K. You are currently in cell (1,1). You have to reach the cell (N,M) using the shortest path possible and can only travel through path having no obstacles. You have to find whether the shortest path you got is >=K or not (I don’t clearly remember the condition for K, but it was similar.

  3. There is a shop and it receives N phone calls for placing orders. The start time, end time and total weight of orders to placed are given like:
    N
    Start-time End-time Order-Value

    Some cost of per kg was given. The task was to find the maximum profit the shopkeeper can earn. You can pick only one call at a time. If two people call at the same time or someone calls while the shopkeeper is on another call, the call is rejected and the order is not placed. So, the shopkeeper optimally picks up the call to earn maximum profit.

There might be some basic changes for these problem, but the main idea remains the same.

2 Likes
72

Thanks for sharing.

1 Like
73

Did anyone else received mail?

74

After filling the google doc if anyone receives further interview details please ping here.

75

You qualified the coding round ?

76

Ya I got the mail some days back But I messed up in UI/ Full stack round . thus I was not hoping but luckily I got the email some days ago.