Off-Campus LinkedIn SDE Intern 2025

I recently went through the LinkedIn SDE Intern (2025) hiring process (off-campus).

Process Overview:

• Round 1: Resume Shortlisting – My application was shortlisted based on academic background and project work.

• Round 2: Online Assessment (OA) – Consisted of 2 DSA coding problems:

  • Best Sum Downward Tree Path – Implemented a DFS-based solution to compute the maximum downward path sum in a tree represented by parent-child relationships.
  • Minimize Maximum Vulnerability – Solved using binary search + greedy to select non-adjacent servers minimizing max vulnerability.

Both solutions passed all test cases.

Outcome:

Although I cleared both rounds, I was not selected for further stages.

Takeaway:

This experience gave me great exposure to tree-based DP, binary search on answer, and greedy problem-solving, and reaffirmed the importance of writing clean, optimal code under time constraints.

Implement a function to compute the maximum sum of any downward path in a tree, represented by a parent array and node values.