Problem database last updated: June 20, 2025
6 problems · 2 Easy, 4 Medium, 0 Hard · Ranked #208 of 458
2 Easy
33% · avg 23%
4 Medium
67% · avg 59%
0 Hard
0% · avg 18%
Based on 6 reported problems, LiveRamp interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (67%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, LiveRamp puts unusual emphasis on two-pointers (33.3% of problems, 2.5x the industry average), sorting (33.3% of problems, 2.3x the industry average), hash-table (33.3% of problems, 1.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (66.7%), hash-table (33.3%), two-pointers (33.3%), sorting (33.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Distribute Candies Alice has n candies, where the ith candy is of type candyType[i]. Alice noticed that she started to gain weight, so she visited a doctor. | Easy | Very Likely | arrayhash-table | Solve |
Shortest Unsorted Continuous Subarray Given an integer array nums, you need to find one continuous subarray such that if you only sort this subarray in non-decreasing order, then the whole array wil... | Medium | Very Likely | arraytwo-pointersstack | Solve |
Longest Harmonious Subsequence We define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1. | Easy | Very Likely | arrayhash-tablesliding-window | Solve |
Largest Time for Given Digits Given an array arr of 4 digits, find the latest 24-hour time that can be made using each digit exactly once. | Medium | Very Likely | arraystringbacktracking | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Course Schedule There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b... | Medium | Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Distribute Candies
SolveAlice has n candies, where the ith candy is of type candyType[i]. Alice noticed that she started to gain weight, so she visited a doctor.
Shortest Unsorted Continuous Subarray
SolveGiven an integer array nums, you need to find one continuous subarray such that if you only sort this subarray in non-decreasing order, then the whole array wil...
Longest Harmonious Subsequence
SolveWe define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1.
Largest Time for Given Digits
SolveGiven an array arr of 4 digits, find the latest 24-hour time that can be made using each digit exactly once.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Course Schedule
SolveThere are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent LiveRamp interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
LiveRamp interviews focus heavily on array, hash-table, two-pointers problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. LiveRamp interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
LiveRamp has been reported to ask 6 distinct coding problems. The most common topics are array, hash-table, two-pointers. 2 are Easy difficulty, 4 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 6 reported problems, LiveRamp interviews are easier than average - only 0% Hard compared to 18% across all companies. 67% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, two-pointers. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real LiveRamp coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a LiveRamp interview with AIarrow_forward
