linkedin logo
LinkedIn· Staff Infra

Linkedin Staff Infra interview Experience

Posted
18 Jul 2025
428 reads

Summary

I interviewed for a Staff Infra role at Linkedin, undergoing multiple screening and onsite rounds that included coding, behavioral, leadership, and system design challenges, ultimately leading to a rejection.

How it went

Screening Rounds

Round 1(Coding):

Round 2 (Staff Host Leader)

  • Behavioural questions similar to above with examples of any project
  • Leadership questions such as explain any complex project you have led

Onsite

Coding Round 1:

  • Tree has keys and values, values represent sum of this and child node values
    When merging - absent branches should be created, and values for existing branches are summed
    Keys are unique among child nodes of a single parent
    Child nodes could be stored in any order
    // #     Root:10
    // #     /  |  \
    // #    A:2 B:2 M:6
    // #     |  |
    // #    L:2 L:2
    

    // # Target tree T

    // # Root:13 // # / |
    // # A:4 B:3 D:6 // # /
    // #. L:4 M:6

    // # Result tree RT

    // # Root:23 // # / | \
    // # A:6 B:5 D:6 M:6 // # / | | // # L:6 L:2 M:6

Coding Round 2:

  • You have given users and its direct connections. For a given two users S and P, find minimum degree of connection. Degree of directly connected users is 1.
    Expected ans: Bidirectional bfs
    Follow up: Find the path

Staff Software Design and Architecture Round:

  • Design metrics aggregation system

Staff Infrastructure Design and Implementation:

  • Design a system which takes stream of linkedin posts and form a inverted index of all the words in the post. The user will query a list of words, you have to return all the post ids which has all the given list of words.

Result: Rejected

Questions asked (5)

  1. 01

    All O(1) Data Structure

    Data Structures & Algorithms · Hard

    Design a data structure that supports the following operations in O(1) time: inc(key), dec(key), getMaxKey(), getMinKey().

    Open the problem
  2. 02

    Merge Trees with Summed Values

    Data Structures & Algorithms

    Tree has keys and values, values represent sum of this and child node values. When merging, absent branches should be created, and values for existing branches are summed. Keys are unique among child nodes of a single parent. Child nodes could be stored in any order.

    // #     Root:10
    // #     /  |  \
    // #    A:2 B:2 M:6
    // #     |  |
    // #    L:2 L:2
    
    // # Target tree T
    
    // #      Root:13
    // #     /  |   \
    // #    A:4 B:3 D:6
    // #    /        \
    // #.  L:4        M:6
    
    // # Result tree RT
    
    // #          Root:23
    // #      /     |   \    \
    // #    A:6    B:5   D:6  M:6
    // #    /       |     |
    // #   L:6     L:2   M:6
    
  3. 03

    Minimum Degree of Connection (Bidirectional BFS)

    Data Structures & Algorithms

    You have given users and its direct connections. For a given two users S and P, find minimum degree of connection. Degree of directly connected users is 1. Follow up: Find the path.

  4. 04

    Design Metrics Aggregation System

    System Design

    Design a system for aggregating metrics.

  5. 05

    Design Inverted Index for LinkedIn Posts

    System Design

    Design a system which takes stream of linkedin posts and form a inverted index of all the words in the post. The user will query a list of words, you have to return all the post ids which has all the given list of words.

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!