linkedin logo
LinkedIn· SDE II

LinkedIn | SSE | Phone Screen | Rejected

Posted
2 Sept 2026
166 reads

Summary

I had a phone screen for a Senior Software Engineer role at LinkedIn, solved two coding questions but missed an edge case on the first one and was rejected.

How it went

I was reached out by a recruiter on LinkedIn.

Phone Screen was soon scheduled.

Phone Screen (1 hour) :

Q1 : It was a variation of https://leetcode.com/problems/can-place-flowers where more than one queries will be provided and each query needed to be solved in O(1)

I was able to solve this but I missed an edge case here

Q2 : It was straight forward Nested List Weight Sum II : https://leetcode.com/problems/nested-list-weight-sum-ii

Solved it easily.

I received rejection next day, I guess it was due to Q1 missing edge case scenario.

I hope this helps anyone preparing in future. Happy Grinding !

Questions asked (2)

  1. 01

    Can Place Flowers Variation with Multiple O(1) Queries

    Data Structures & Algorithms · Medium

    Given a flowerbed represented by an array of 0s (empty) and 1s (occupied), determine if you can place a new flower without violating the no-adjacent-flowers rule. In this variation, you receive multiple queries, each asking whether a flower can be placed at a specific position, and each query must be answered in O(1) time.

    Open the problem
  2. 02

    Nested List Weight Sum II

    Data Structures & Algorithms · Medium

    Given a nested list of integers, where each element is either an integer or a list, compute the sum of all integers weighted by their depth from the bottom up (the deepest level has weight 1).

    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!