Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en LinkedIn (Bengaluru) en oct 2024
Entrevista
OA had 3 DSA questions all were doable leetcode mediums.
Round 1 : 2 DSA questions
Q1: Sort 2 sorted arrays without using extra space, standard leetcode question, solve this in a single pass and handle all edge cases
I had a bug here but I found it out on my own and solved it easily
Q2: Find LCA of two nodes, but instead of being provided the root node, each child node has a parent pointer. (I solved this in 2 passes without using extra space)
Round 2: Host Manager round
I got asked standard HR questions about what I have done in my internship(s), how I solved problems I faced here, etc. I couldn't answer them as well as I could've so might have been the reason for my rejection.
Preguntas de entrevista [1]
Pregunta 1
How do I approach any new problem, the problem can be technical or some situational scenario related to handling people.
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
Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en LinkedIn (Bengaluru) en sep 2025
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 1
Implement a function to compute the maximum sum of any downward path in a tree represented by a parent array and node values.
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
Preguntas de entrevista [1]
Pregunta 1
A question about modular inverse basically had a pnc problem
