LinkedIn Loop Rounds IC2

Posted
10 Sept 2026
182 reads

Summary

I went through LinkedIn's IC2 interview loop, which included an elimination round, DSA round, AI + coding round, hiring manager interview, system design interview, and a technical communication round.

How it went

Sharing my LinkedIn IC2 interview loop experience for anyone preparing for similar interviews.

Here are the questions/topics that were covered across the rounds:

Elimination Round

  1. Maximum Depth of Binary Tree
  2. Zigzag Level Order Traversal

Round 1 – DSA

  1. Max Points on a Line / Max Collinear Points
  2. Minimum Length Substring

Round 2 – AI + Coding LRU Cache with Counters Given different workloads, predict/calculate the cache hit/miss ratio The round involved combining coding with reasoning around the AI/system behavior

Round 3 – Hiring Manager Behavioral questions Discussion around past projects and experiences

Round 4 – System Design Design Google Calendar Discussion around the architecture, components, scalability, and design decisions

Round 5 – Technical Communication Deep dive into past projects Detailed discussion around technical decisions, challenges, trade-offs, and implementation

Hope this helps.

Questions asked (7)

  1. 01

    Maximum Depth of Binary Tree

    Data Structures & Algorithms

    Given the root of a binary tree, compute the maximum depth (or height) of the tree, which is the number of nodes along the longest path from the root node down to the farthest leaf node.

  2. 02

    Zigzag Level Order Traversal

    Data Structures & Algorithms

    Given a binary tree, return its node values in a zigzag level order traversal (also known as “snake” order), where the first level is traversed left‑to‑right, the second level right‑to‑left, and so on.

  3. 03

    Max Points on a Line

    Data Structures & Algorithms

    Given a set of points in a 2D plane, determine the maximum number of points that lie on the same straight line.

  4. 04

    Minimum Length Substring

    Data Structures & Algorithms

    Find the smallest substring of a given string that satisfies a specific condition (e.g., contains all required characters or meets a particular pattern). The exact requirement was not detailed in the post.

  5. 05

    LRU Cache with Counters

    Data Structures & Algorithms

    Implement an LRU (Least Recently Used) cache that, in addition to standard get/put operations, maintains counters or metrics for cache usage.

  6. 06

    Cache Hit/Miss Ratio Calculation

    Other

    Given different workload patterns, calculate or predict the cache hit and miss ratios, discussing how workload characteristics affect cache performance.

  7. 07

    Design Google Calendar

    System Design

    Design a scalable calendar service like Google Calendar. Discuss architecture, core components, data storage, synchronization, scalability, and design trade‑offs.

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!