LinkedIn Interview Questions — 100 DSA Problems

82 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked LinkedIn LeetCode questions for software engineering interviews.

• Max Stack (HARD) — Linked List, Stack, Design, Doubly-Linked List, Ordered Set
• Nested List Weight Sum II (MEDIUM) — Stack, Depth-First Search, Breadth-First Search
• All O`one Data Structure (HARD) — Hash Table, Linked List, Design, Doubly-Linked List
• Word Ladder (HARD) — Hash Table, String, Breadth-First Search
• Find the Celebrity (MEDIUM) — Two Pointers, Graph, Interactive
• Nested List Weight Sum (MEDIUM) — Depth-First Search, Breadth-First Search
• Shortest Word Distance II (MEDIUM) — Array, Hash Table, Two Pointers, String, Design
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Find Leaves of Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Valid Parentheses (EASY) — String, Stack
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Maximum Product Subarray (MEDIUM) — Array, Dynamic Programming
• Can Place Flowers (EASY) — Array, Greedy
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Pow(x, n) (MEDIUM) — Math, Recursion
• Binary Tree Upside Down (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Partition to K Equal Sum Subsets (MEDIUM) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask
• Find First and Last Position of Element in Sorted Array (MEDIUM) — Array, Binary Search
• Paint House (MEDIUM) — Array, Dynamic Programming
• Serialize and Deserialize Binary Tree (HARD) — String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree
• Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
• Maximum Depth of Binary Tree (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Factor Combinations (MEDIUM) — Backtracking
• Shortest Word Distance (EASY) — Array, String
• Exclusive Time of Functions (MEDIUM) — Array, Stack
• Lowest Common Ancestor of a Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
• Lowest Common Ancestor of a Binary Search Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Isomorphic Strings (EASY) — Hash Table, String
• Symmetric Tree (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Sort Transformed Array (MEDIUM) — Array, Math, Two Pointers, Sorting
• Merge Intervals (MEDIUM) — Array, Sorting
• Count Integers in Intervals (HARD) — Design, Segment Tree, Ordered Set
• Valid Perfect Square (EASY) — Math, Binary Search
• Valid Number (HARD) — String
• Kth Smallest Product of Two Sorted Arrays (HARD) — Array, Binary Search
• Max Points on a Line (HARD) — Array, Hash Table, Math, Geometry
• Second Minimum Node In a Binary Tree (EASY) — Tree, Depth-First Search, Binary Tree
• Closest Binary Search Tree Value II (HARD) — Two Pointers, Stack, Tree, Depth-First Search, Binary Search Tree, Heap (Priority Queue), Binary Tree
• House Robber (MEDIUM) — Array, Dynamic Programming
• Evaluate Reverse Polish Notation (MEDIUM) — Array, Math, Stack
• Repeated DNA Sequences (MEDIUM) — Hash Table, String, Bit Manipulation, Sliding Window, Rolling Hash, Hash Function
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Binary Tree Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree
• Can I Win (MEDIUM) — Math, Dynamic Programming, Bit Manipulation, Memoization, Game Theory, Bitmask
• Longest Palindromic Subsequence (MEDIUM) — String, Dynamic Programming
• Permutations II (MEDIUM) — Array, Backtracking, Sorting
• Merge Two Sorted Lists (EASY) — Linked List, Recursion