Rippling Interview Questions — 16 DSA Problems

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

Most frequently asked Rippling LeetCode questions for software engineering interviews.

• Design Excel Sum Formula (HARD) — Array, Hash Table, String, Graph, Design, Topological Sort, Matrix
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Design Spreadsheet (MEDIUM) — Array, Hash Table, String, Design, Matrix
• Evaluate Division (MEDIUM) — Array, String, Depth-First Search, Breadth-First Search, Union Find, Graph, Shortest Path
• Synonymous Sentences (MEDIUM) — Array, Hash Table, String, Backtracking, Union Find
• Employee Importance (MEDIUM) — Array, Hash Table, Tree, Depth-First Search, Breadth-First Search
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Optimal Account Balancing (HARD) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
• Last Stone Weight (EASY) — Array, Heap (Priority Queue)
• Number of Visible People in a Queue (HARD) — Array, Stack, Monotonic Stack
• Accounts Merge (MEDIUM) — Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• LFU Cache (HARD) — Hash Table, Linked List, Design, Doubly-Linked List
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Maximize Amount After Two Days of Conversions (MEDIUM) — Array, String, Depth-First Search, Breadth-First Search, Graph
• Alien Dictionary (HARD) — Array, String, Depth-First Search, Breadth-First Search, Graph, Topological Sort