Professional networking platform with rich data and ML-driven recommendations.
4 Rounds
~21 Days
Hard
The Interview Loop
Recruiter Screen (30 min)
Standard fit check, behavioral questions, and resume overview.
Technical Loop (3-4 Rounds)
Deep dive into domain knowledge, coding, and system design.
Interview Question Bank
Cloud Engineer
•
Coding
•
medium
Given a list of server downtime intervals represented as [start_time, end_time], merge all overlapping intervals to calculate the total duration the cluster was degraded.
#Arrays
#Sorting
#Intervals
Cloud Engineer
•
Coding
•
medium
Write a script to parse a large web server log file and return the top 10 IP addresses by request volume. How would you handle a file that is too large to fit into memory?
#Hash Map
#Heap
#File I/O
#Python
Cloud Engineer
•
Coding
•
medium
Implement a rate limiter class that allows a maximum of N requests per minute per user. If a user exceeds the limit, return false.
#Queue
#Hash Map
#Concurrency
Cloud Engineer
•
Coding
•
hard
Given a list of cloud infrastructure components and their dependencies, write a function to determine a valid deployment order. What if there is a circular dependency?
#Graphs
#Topological Sort
#DFS
Cloud Engineer
•
Coding
•
easy
Write a function to validate if a given string representing a JSON or YAML configuration file has properly balanced and nested brackets, braces, and parentheses.
#Stack
#String Manipulation
Data Engineer
•
Coding
•
easy
Given an array of strings representing words and two distinct words, find the shortest distance between these two words in the list.
#Arrays
#Two Pointers
Data Engineer
•
Coding
•
medium
Given an array of integers `nums` sorted in ascending order (with distinct values), and a target integer `target`, write a function to search `target` in `nums`. If `target` exists, then return its index. Otherwise, return -1. The array might be rotated at an unknown pivot.
#Binary Search
#Arrays
Data Engineer
•
Coding
•
medium
Implement an LRU (Least Recently Used) Cache. This is often used in data engineering to cache frequent database lookups.
#Data Structures
#Hash Table
#Linked List
Data Engineer
•
Coding
•
medium
Given a binary tree representing a company's organizational chart, write a function to find the lowest common manager (Lowest Common Ancestor) of two given employees.
#Trees
#Recursion
#Depth-First Search
Data Engineer
•
Coding
•
medium
Given a non-empty list of job search keywords and an integer K, return the K most frequent keywords. Sort the result by frequency from highest to lowest, and alphabetically for ties.
#Hash Table
#Heap
#Sorting
Data Engineer
•
Coding
•
medium
Given an array of intervals representing active user sessions on LinkedIn, merge all overlapping intervals to find the total continuous active time.
#Sorting
#Arrays
#Intervals
Data Engineer
•
Coding
•
medium
Write a function to find all LinkedIn connections of a specific user up to the Nth degree. You are given an API getConnections(userId) that returns a list of direct connections.
#Graphs
#Breadth-First Search
#Queues
Data Engineer
•
Coding
•
medium
Given a list of nested integers, return the sum of all integers in the list weighted by their depth. For example, given the list {{1,1},2,{1,1}}, return 10.
#Depth-First Search
#Recursion
#Arrays
Data Scientist
•
Coding
•
medium
Write a Python script to parse a log file of user events and return the most frequent sequence of 3 pages visited before a job application.
#Data Manipulation
#Sliding Window
#Hashing
Data Scientist
•
Coding
•
medium
Given an adjacency list representing LinkedIn connections, write a function to find the shortest path (degrees of separation) between two users.
#Graphs
#BFS
#Python
Data Scientist
•
Coding
•
easy
Write a Python function to compute the Jaccard similarity between two users based on their listed skills.
#Python
#Set Operations
#Math
Data Scientist
•
Coding
•
easy
Given an array of daily active users for the past year, find the longest contiguous subarray where the DAU is strictly increasing.
#Arrays
#Dynamic Programming
#Python
Data Scientist
•
Coding
•
hard
Implement a K-Means clustering algorithm from scratch in Python to group similar job postings.
#Machine Learning from Scratch
#Linear Algebra
#Python
DevOps Engineer
•
Coding
•
medium
Implement an LRU (Least Recently Used) Cache with O(1) time complexity for get and put operations.
#Data Structures
#Hash Map
#Doubly Linked List
DevOps Engineer
•
Coding
•
medium
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals.
#Arrays
#Sorting
DevOps Engineer
•
Coding
•
easy
Write a Python function to check if a string containing only parentheses '()', '{}', and '[]' is valid. The brackets must close in the correct order.
#Stacks
#Strings
Frontend Engineer
•
Coding
•
medium
Given a string of HTML, write a function to check if the tags are balanced.
#Stacks
#String Parsing
#Data Structures
Frontend Engineer
•
Coding
•
medium
Implement a function that deeply merges two JavaScript objects.
#Recursion
#Object Manipulation
Frontend Engineer
•
Coding
•
medium
Implement an LRU (Least Recently Used) Cache class to store fetched user profiles.
#Data Structures
#Caching
#Map
Frontend Engineer
•
Coding
•
medium
Write a function to traverse a DOM tree and return an array of all text nodes.
#DOM Manipulation
#Tree Traversal
#Recursion
Frontend Engineer
•
Coding
•
medium
Write a function to flatten a deeply nested JavaScript object into a single-level object with dot-separated keys.
#Recursion
#Data Structures
#Object Manipulation
Frontend Engineer
•
Coding
•
easy
Write a function to convert a camelCase string to snake_case, handling edge cases like consecutive capital letters.
#String Manipulation
#Regular Expressions
Frontend Engineer
•
Coding
•
medium
Implement a function to find the lowest common ancestor of two nodes in a DOM tree.
#DOM Manipulation
#Tree Traversal
Full Stack Engineer
•
Coding
•
hard
Given a list of connections and their skills, write an algorithm to recommend 5 new skills to a user based on what their connections have.
#Hash Map
#Sorting
#Recommendation Systems
Full Stack Engineer
•
Coding
•
medium
Design and implement an LRU Cache to store recently viewed LinkedIn profiles.
#Data Structures
#Linked List
#Hash Map
Full Stack Engineer
•
Coding
•
hard
Given a stream of job postings, design a class to efficiently find the top K most frequently required skills.
#Heap
#Hash Map
#Streaming Data
Full Stack Engineer
•
Coding
•
medium
Given a graph of LinkedIn users, write a function to find the shortest path (degrees of separation) between two users.
#Graph
#BFS
#Data Structures
Full Stack Engineer
•
Coding
•
medium
Given a list of a user's job experiences represented as time intervals, merge all overlapping intervals to find their total actual time employed.
#Arrays
#Sorting
#Intervals
Full Stack Engineer
•
Coding
•
hard
Given a string representing a user's profile summary, write a function to justify the text (Left, Right, or Center) to fit within a specific column width.
#Strings
#Formatting
#Edge Cases
Full Stack Engineer
•
Coding
•
medium
Find the Lowest Common Manager (LCA) for two employees in the LinkedIn org chart.
#Trees
#DFS
#Recursion
Full Stack Engineer
•
Coding
•
medium
Implement a Trie data structure to support typeahead suggestions for LinkedIn connections.
#Trie
#Strings
#Design
Full Stack Engineer
•
Coding
•
medium
Write a function to flatten a deeply nested JSON object representing a LinkedIn user's full data export.
#Recursion
#JSON
#Object Manipulation
Full Stack Engineer
•
Coding
•
medium
Given a matrix representing a network grid, find the number of isolated connection clusters (Number of Islands).
#Graph
#DFS
#BFS
Full Stack Engineer
•
Coding
•
easy
Given an array of integers representing daily profile views, find the maximum subarray sum (highest engagement period).
#Arrays
#Dynamic Programming
Full Stack Engineer
•
Coding
•
medium
Write a function to determine if two users are exactly 3 degrees of separation apart.
#Graph
#BFS
#Search
Machine Learning Engineer
•
Coding
•
hard
Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the maximum number of points that lie on the same straight line.
#Array
#Math
#Geometry
#Hash Table
Machine Learning Engineer
•
Coding
•
easy
Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t.
#Hash Table
#String
Machine Learning Engineer
•
Coding
•
medium
Given an integer array nums, return the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.
#Array
#Two Pointers
#Sorting
#Greedy
Machine Learning Engineer
•
Coding
•
medium
Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.
#Array
#Backtracking
Machine Learning Engineer
•
Coding
•
hard
Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work.
#String
#Tree
#Depth-First Search
#Breadth-First Search
#Design
Machine Learning Engineer
•
Coding
•
medium
Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
#Array
#Divide and Conquer
#Sorting
#Heap (Priority Queue)
#Quickselect
Machine Learning Engineer
•
Coding
•
medium
Given the root of a binary tree, collect a tree's nodes as if you were doing this: Collect all the leaf nodes, remove all the leaf nodes, and repeat until the tree is empty.
#Tree
#Depth-First Search
#Binary Tree
Machine Learning Engineer
•
Coding
•
medium
Design a class which receives a list of words in the constructor, and implements a method that takes two words word1 and word2 and returns the shortest distance between these two words in the list. The method will be called repeatedly.
#Array
#Hash Table
#Two Pointers
#Design
Machine Learning Engineer
•
Coding
•
easy
You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. Given an integer array flowerbed containing 0's and 1's, and an integer n, return true if n new flowers can be planted without violating the no-adjacent-flowers rule.
#Array
#Greedy
Machine Learning Engineer
•
Coding
•
medium
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
#Tree
#Depth-First Search
#Binary Tree
Software Engineer
•
Coding
•
medium
Given a list of intervals representing a user's work experiences (start_year, end_year), merge all overlapping experiences to find the total years of experience.
#Array
#Sorting
#Intervals
Software Engineer
•
Coding
•
medium
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. (Nested List Weight Sum)
#DFS
#BFS
#Array
Software Engineer
•
Coding
•
hard
Given a graph representing LinkedIn connections, write a function to find the shortest path (degrees of separation) between two members.
#Graph
#BFS
#Shortest Path
Software Engineer
•
Coding
•
hard
A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that every adjacent pair of words differs by a single letter. Given two words, beginWord and endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence.
#Hash Table
#String
#Breadth-First Search
Software Engineer
•
Coding
•
medium
Implement the RandomizedSet class: insert(val), remove(val), and getRandom(). Each function must run in average O(1) time complexity.
#Array
#Hash Table
#Math
#Design
#Randomized
Software Engineer
•
Coding
•
medium
Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity.
#Array
#Binary Search
Software Engineer
•
Coding
•
easy
Given an integer array nums, find the subarray with the largest sum, and return its sum.
#Array
#Dynamic Programming
#Divide and Conquer
Software Engineer
•
Coding
•
medium
Given the root of a binary tree, collect a tree's nodes as if you were doing this: Collect all the leaf nodes. Remove all the leaf nodes. Repeat until the tree is empty.
#Tree
#Depth-First Search
#Binary Tree
Software Engineer
•
Coding
•
medium
There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index. Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.
#Array
#Binary Search
Software Engineer
•
Coding
•
easy
You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. Given an integer array flowerbed containing 0's and 1's, and an integer n, return true if n new flowers can be planted.
#Array
#Greedy
Software Engineer
•
Coding
•
medium
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
#Tree
#Depth-First Search
#Binary Tree
Software Engineer
•
Coding
•
medium
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
#Array
#Sorting
Software Engineer
•
Coding
•
hard
Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified.
#Array
#String
#Simulation
Software Engineer
•
Coding
•
hard
Given a string s, return true if s is a valid number. For example, '2', '0089', '-0.1', '+3.14', '4.', '-.9', '2e10', '-90E3', '3e+7', '+6e-1', '53.5e93', '-123.456e789' are valid.
#String
#Math
Software Engineer
•
Coding
•
hard
Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
#Tree
#Depth-First Search
#Breadth-First Search
#Design
#String
Software Engineer
•
Coding
•
easy
Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t.
#Hash Table
#String
Software Engineer
•
Coding
•
medium
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list -- whose elements may also be integers or other lists. The depth is defined such that leaves have a weight of 1, and the root has the maximum weight.
#Depth-First Search
#Breadth-First Search
Software Engineer
•
Coding
•
medium
There is an integer array nums sorted in ascending order (with distinct values) that is possibly rotated. Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.
#Binary Search
#Array
Software Engineer
•
Coding
•
medium
Given the root of a binary tree, return the lowest common ancestor of two given nodes in the tree.
#Tree
#DFS
Software Engineer
•
Coding
•
medium
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. However, the weight is defined from bottom up. (Nested List Weight Sum II)
#DFS
#BFS
#Math
Software Engineer
•
Coding
•
medium
Evaluate the value of an arithmetic expression in Reverse Polish Notation.
#Stack
#Math
#Array
Software Engineer
•
Coding
•
medium
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
#Array
#Dynamic Programming
#Divide and Conquer
Software Engineer
•
Coding
•
medium
Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form.
#Backtracking
#Hash Table
#String
Software Engineer
•
Coding
•
medium
Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
#Binary Search
#Array
Software Engineer
•
Coding
•
medium
Design a class which receives a list of words in the constructor, and implements a method that takes two words word1 and word2 and return the shortest distance between these two words in the list. The method will be called repeatedly.
#Array
#Hash Table
#Two Pointers
#Design
Software Engineer
•
Coding
•
hard
Given a binary tree, design an algorithm to serialize and deserialize it.
#Tree
#String
#Design
#DFS/BFS
Software Engineer
•
Coding
•
easy
Design a data structure that supports the following operations: add(number) and find(value). find(value) returns true if there exists any pair of numbers whose sum is equal to the value.
#Design
#Hash Table
#Two Pointers
Software Engineer
•
Coding
•
medium
Given an integer array nums, return the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.
#Array
#Two Pointers
#Sorting
#Greedy
Difficulty Radar
Based on recent AI-sourced data.
Meet Your Interviewers
The "Standard" Interviewer
Senior EngineerFocuses on core competencies, system constraints, and clear communication.
SimulateUnwritten Rules
Think Out Loud
Always explain your thought process before writing code or drawing architecture.