LiveRamp coding interview
questions, leaked.
6 problems reported across recent LiveRamp interviews. Top patterns: array, two pointers, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
LiveRamp's assessment is lean but punishing. Six problems total, four of them medium difficulty, and array manipulation dominates the topic distribution. You're looking at a focused drill on arrays, two-pointers, and string problems, with enough variety in each to catch you off-guard if you've only memorized one approach. If you blank on how to handle a two-pointer reversal or a sliding-window count mid-assessment, StealthCoder runs invisible during screen share and surfaces a working solution in seconds. Most candidates see Longest Harmonious Subsequence and Shortest Unsorted Continuous Subarray and know they're in trouble if they haven't practiced both patterns back-to-back.
Top problems at LiveRamp
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Largest Time for Given Digits | MEDIUM | 100.0 | 36% | Array · String · Backtracking |
| 02 | Longest Harmonious Subsequence | EASY | 100.0 | 57% | Array · Hash Table · Sliding Window |
| 03 | Shortest Unsorted Continuous Subarray | MEDIUM | 100.0 | 37% | Array · Two Pointers · Stack |
| 04 | Distribute Candies | EASY | 100.0 | 70% | Array · Hash Table |
| 05 | Longest Palindromic Substring | MEDIUM | 65.1 | 36% | Two Pointers · String · Dynamic Programming |
| 06 | Course Schedule | MEDIUM | 65.1 | 49% | Depth-First Search · Breadth-First Search · Graph |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual LiveRamp OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array4 · 67%
- two pointers2 · 33%
- string2 · 33%
- hash table2 · 33%
- sorting2 · 33%
- dynamic programming1 · 17%
- backtracking1 · 17%
- enumeration1 · 17%
- sliding window1 · 17%
- counting1 · 17%
Four of six problems involve arrays, and they're not simple iterations. You'll face Longest Harmonious Subsequence (which chains hash-table and sorting logic), Shortest Unsorted Continuous Subarray (two-pointers plus stack thinking), and string work like Longest Palindromic Substring that crosses into dynamic programming. Two-pointers and hash-tables each appear twice, so your foundation here has to be solid. The difficulty cliff is real: two easy problems won't carry you. Backtracking and enumeration show up once each (Largest Time for Given Digits is a classic permutation grind), so you need to drill those patterns cold. If you haven't practiced two-pointer traversals on sorted subarrays or hash-table counting on subsequences, you're walking in blind. StealthCoder is your hedge for the moment you hit a pattern you didn't have time to drill.
Companies with similar patterns
If you prepped for LiveRamp, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass LiveRamp.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
LiveRamp interview FAQ
How many array problems should I solve before the LiveRamp assessment?+
Array work is 67% of their problem set. Drill at least 10-15 array problems focusing on two-pointers, sorting, and hash-table variants. Shortest Unsorted Continuous Subarray and Longest Harmonious Subsequence are the exact patterns they ask.
Is two-pointers enough to pass, or do I need dynamic programming too?+
Two-pointers alone won't cut it. Longest Palindromic Substring is medium difficulty and requires DP thinking. You need both patterns. Spend 3-4 hours on DP fundamentals before the assessment.
What should I study first for LiveRamp?+
Start with array and hash-table fundamentals. Four of six problems are array-based. Once you're comfortable with hash-table counting and two-pointer reversals, move to string and DP. Backtracking comes last.
How hard is the LiveRamp assessment compared to other tech screens?+
Four medium problems out of six is above average difficulty. No hard problems, but the medium ones chain multiple concepts. Longest Palindromic Substring and Shortest Unsorted Continuous Subarray require both pattern recognition and implementation speed.
Should I worry about graph or topological sort?+
Course Schedule appears in their data, but only once. Don't spend heavy time on graph theory. Master arrays, strings, and two-pointers first. Graph is a nice-to-know, not a must-have for passing.