linkedin logo
LinkedIn· SDE II

Linkedin Phone Screen | SSE | Bengaluru

Result
Ongoing
Location
Bengaluru
Posted
28 Oct 2025
509 reads

Summary

I recently completed a phone screen interview with Linkedin for an SSE role in Bengaluru, which covered various technical topics and a specific LeetCode problem.

How it went

I had a phone screen interview for an SSE position at Linkedin in Bengaluru. The discussion began with my current projects, where I was asked to elaborate on the most complex project I've worked on and suggest potential improvements to the system. Following this, the interviewer delved into core Java and Object-Oriented Programming (OOPS) concepts. We then moved on to Operating Systems, Multithreading, and Concurrency topics. The final part of the interview involved solving a specific LeetCode problem.

Questions asked (1)

  1. 01

    Nested List Weight Sum II

    Data Structures & Algorithms · Medium

    Given a nested list of integers, nestedList, where each element is either an integer or a list (which can itself contain integers or other lists), calculate the sum of all integers in the list weighted by their depth. The weight of an integer is calculated from the bottom up. That is, the deepest integers have the largest weight. If the maximum depth of any integer in the nested list is maxDepth, and an integer is at depth d (where the root list is depth 1), its weight will be maxDepth - d + 1. For example, for [1,[4,[6]]], the max depth is 3. The integer 1 is at depth 1 (weight 3), 4 at depth 2 (weight 2), and 6 at depth 3 (weight 1). The sum would be (13) + (42) + (6*1) = 17.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at LinkedIn recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!