there was the coding round first which had two questions of moderate difficulty, this was followed by the interview which also had moderate difficulty of about 1200-1400 rated codeforces questions

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.

It had a online assessment and the questions were directly from codeforces, there was a difficult question with modular inverse, it was a pnc question kinda did it using dp but was wrong , read about fermats little theorem