Problem database last updated: June 20, 2025
9 problems · 2 Easy, 6 Medium, 1 Hard · Ranked #159 of 458
2 Easy
22% · avg 23%
6 Medium
67% · avg 59%
1 Hard
11% · avg 18%
Based on 9 reported problems, Rivian interviews are in line with industry averages - 11% Hard vs 18% overall. 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, Rivian puts unusual emphasis on linked-list (22.2% of problems, 3.1x the industry average), matrix (22.2% of problems, 2.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (44.4%), hash-table (22.2%), linked-list (22.2%), matrix (22.2%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Very Likely | hash-tablelinked-listdesign | Solve |
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
String Compression Given an array of characters chars, compress it using the following algorithm: | Medium | Very Likely | two-pointersstring | Solve |
Rotate String Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s. | Easy | Very Likely | stringstring-matching | Solve |
Degree of an Array Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements. | Easy | Very Likely | arrayhash-table | Solve |
Flatten Deeply Nested Array Given a multi-dimensional array arr and a depth n, return a flattened version of that array. | Medium | Very Likely | Solve | |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Very Likely | arraysorting | Solve |
Max Increase to Keep City Skyline There is a city composed of n x n blocks, where each block contains a single building shaped like a vertical square prism. You are given a 0-indexed n x n integ... | Medium | Very Likely | arraygreedymatrix | Solve |
Merge k Sorted Lists You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. | Hard | Very Likely | linked-listdivide-and-conquerheap-priority-queue | Solve |
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
String Compression
SolveGiven an array of characters chars, compress it using the following algorithm:
Rotate String
SolveGiven two strings s and goal, return true if and only if s can become goal after some number of shifts on s.
Degree of an Array
SolveGiven a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.
Flatten Deeply Nested Array
SolveGiven a multi-dimensional array arr and a depth n, return a flattened version of that array.
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Max Increase to Keep City Skyline
SolveThere is a city composed of n x n blocks, where each block contains a single building shaped like a vertical square prism. You are given a 0-indexed n x n integ...
Merge k Sorted Lists
SolveYou are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Rivian interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Rivian interviews focus heavily on array, hash-table, linked-list 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. Rivian 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.
Rivian has been reported to ask 9 distinct coding problems. The most common topics are array, hash-table, linked-list. 2 are Easy difficulty, 6 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 9 reported problems, Rivian interviews are in line with industry averages - 11% Hard vs 18% overall. 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, linked-list. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Rivian coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Rivian interview with AIarrow_forward
