Problem database last updated: June 20, 2025
9 problems · 1 Easy, 7 Medium, 1 Hard · Ranked #158 of 458
1 Easy
11% · avg 23%
7 Medium
78% · avg 59%
1 Hard
11% · avg 18%
Based on 9 reported problems, Applied Intuition interviews are in line with industry averages - 11% Hard vs 18% overall. The majority (78%) 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, Applied Intuition puts unusual emphasis on design (33.3% of problems, 5.8x the industry average), matrix (33.3% of problems, 3.8x the industry average), linked-list (22.2% of problems, 3.1x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (100%), matrix (33.3%), design (33.3%), sorting (22.2%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
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 |
Minesweeper Let's play the minesweeper game (Wikipedia, online game)! | Medium | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
Find Duplicate File in System Given a list paths of directory info, including the directory path, and all the files with contents in this directory, return all the duplicate files in the fil... | Medium | Very Likely | arrayhash-tablestring | Solve |
Find First and Last Position of Element in Sorted Array Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. | Medium | Very Likely | arraybinary-search | Solve |
Maximum Number of Visible Points You are given an array points, an integer angle, and your location, where location = [posx, posy] and points[i] = [xi, yi] both denote integral coordinates on t... | Hard | Likely | arraymathgeometry | Solve |
Range Sum Query 2D - Immutable Given a 2D matrix matrix, handle multiple queries of the following type: | Medium | Likely | arraydesignmatrix | Solve |
Design Circular Queue Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In Fi... | Medium | Likely | arraylinked-listdesign | Solve |
Cyclically Rotating a Grid You are given an m x n integer matrix grid, where m and n are both even integers, and an integer k. | Medium | Likely | arraymatrixsimulation | Solve |
Design HashMap Design a HashMap without using any built-in hash table libraries. | Easy | Likely | arrayhash-tablelinked-list | Solve |
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...
Minesweeper
SolveLet's play the minesweeper game (Wikipedia, online game)!
Find Duplicate File in System
SolveGiven a list paths of directory info, including the directory path, and all the files with contents in this directory, return all the duplicate files in the fil...
Find First and Last Position of Element in Sorted Array
SolveGiven an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
Maximum Number of Visible Points
SolveYou are given an array points, an integer angle, and your location, where location = [posx, posy] and points[i] = [xi, yi] both denote integral coordinates on t...
Range Sum Query 2D - Immutable
SolveGiven a 2D matrix matrix, handle multiple queries of the following type:
Design Circular Queue
SolveDesign your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In Fi...
Cyclically Rotating a Grid
SolveYou are given an m x n integer matrix grid, where m and n are both even integers, and an integer k.
Design HashMap
SolveDesign a HashMap without using any built-in hash table libraries.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Applied Intuition interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Applied Intuition interviews focus heavily on array, matrix, design 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. Applied Intuition 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.
Applied Intuition has been reported to ask 9 distinct coding problems. The most common topics are array, matrix, design. 1 are Easy difficulty, 7 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, Applied Intuition interviews are in line with industry averages - 11% Hard vs 18% overall. 78% 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, matrix, design. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Applied Intuition coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Applied Intuition interview with AIarrow_forward
