Linkedin Phone Screen | SSE | Bengaluru

linkedin logo
linkedin
SDE IIBengaluruOngoing
October 28, 202518 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.

Full Experience

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.

Interview Questions (1)

Q1
Nested List Weight Sum II
Data Structures & AlgorithmsMedium

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.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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