Problem database last updated: June 20, 2025
9 problems · 2 Easy, 5 Medium, 2 Hard · Ranked #163 of 458
2 Easy
22% · avg 23%
5 Medium
56% · avg 59%
2 Hard
22% · avg 18%
Based on 9 reported problems, Attentive interviews are slightly harder than average - 22% Hard vs 18% across all companies. The majority (56%) 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, Attentive puts unusual emphasis on recursion (22.2% of problems, 4.9x the industry average), stack (33.3% of problems, 3.9x the industry average), string (55.6% of problems, 2x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are string (55.6%), array (55.6%), stack (33.3%), hash-table (33.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Remove All Adjacent Duplicates in String II You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left an... | Medium | Very Likely | stringstack | Solve |
Parse Lisp Expression You are given a string expression representing a Lisp-like expression to return the integer value of. | Hard | Very Likely | hash-tablestringstack | Solve |
Valid Palindrome II Given a string s, return true if the s can be palindrome after deleting at most one character from it. | Easy | Likely | two-pointersstringgreedy | Solve |
Find Pivot Index Given an array of integers nums, calculate the pivot index of this array. | Easy | Likely | arrayprefix-sum | 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 | Likely | arraybinary-search | Solve |
Top K Frequent Words Given an array of strings words and an integer k, return the k most frequent strings. | Medium | Likely | arrayhash-tablestring | Solve |
Valid Sudoku Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: | Medium | Likely | arrayhash-tablematrix | Solve |
Evaluate Reverse Polish Notation You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation. | Medium | Likely | arraymathstack | Solve |
Integer to English Words Convert a non-negative integer num to its English words representation. | Hard | Likely | mathstringrecursion | Solve |
Remove All Adjacent Duplicates in String II
SolveYou are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left an...
Parse Lisp Expression
SolveYou are given a string expression representing a Lisp-like expression to return the integer value of.
Valid Palindrome II
SolveGiven a string s, return true if the s can be palindrome after deleting at most one character from it.
Find Pivot Index
SolveGiven an array of integers nums, calculate the pivot index of this array.
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.
Top K Frequent Words
SolveGiven an array of strings words and an integer k, return the k most frequent strings.
Valid Sudoku
SolveDetermine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:
Evaluate Reverse Polish Notation
SolveYou are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation.
Integer to English Words
SolveConvert a non-negative integer num to its English words representation.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Attentive interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Attentive interviews focus heavily on string, array, stack 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. Attentive 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.
Attentive has been reported to ask 9 distinct coding problems. The most common topics are string, array, stack. 2 are Easy difficulty, 5 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 9 reported problems, Attentive interviews are slightly harder than average - 22% Hard vs 18% across all companies. 56% 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: string, array, stack. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Attentive coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Attentive interview with AIarrow_forward
