Problem database last updated: June 20, 2025
21 problems · 2 Easy, 15 Medium, 4 Hard · Ranked #90 of 458
2 Easy
10% · avg 23%
15 Medium
71% · avg 59%
4 Hard
19% · avg 18%
Based on 21 reported problems, HashedIn interviews are in line with industry averages - 19% Hard vs 18% overall. The majority (71%) 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, HashedIn puts unusual emphasis on greedy (23.8% of problems, 2.8x the industry average), bit-manipulation (9.5% of problems, 2.8x the industry average), dynamic-programming (42.9% of problems, 2.2x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (85.7%), dynamic-programming (42.9%), string (23.8%), greedy (23.8%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Maximum Points Inside the Square You are given a 2D array points and a string s where, points[i] represents the coordinates of point i, and s[i] represents the tag of point i. | Medium | Very Likely | arrayhash-tablestring | Solve |
Minimize Length of Array Using Operations You are given a 0-indexed integer array nums containing positive integers. | Medium | Very Likely | arraymathgreedy | Solve |
Count the Number of Powerful Integers You are given three integers start, finish, and limit. You are also given a 0-indexed string s representing a positive integer. | Hard | Very Likely | mathstringdynamic-programming | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Likely | arraytwo-pointersdynamic-programming | Solve |
Maximum Subarray Given an integer array nums, find the subarray with the largest sum, and return its sum. | Medium | Likely | arraydivide-and-conquerdynamic-programming | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Group Anagrams Given an array of strings strs, group the anagrams together. You can return the answer in any order. | Medium | Likely | arrayhash-tablestring | Solve |
Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length... | Medium | Likely | arraydynamic-programminggreedy | Solve |
Jump Game II You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0. | Medium | Likely | arraydynamic-programminggreedy | 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 | Likely | arraydepth-first-searchbreadth-first-search | Solve |
Maximum Product Subarray Given an integer array nums, find a subarray that has the largest product, and return the product. | Medium | Likely | arraydynamic-programming | Solve |
Isomorphic Strings Given two strings s and t, determine if they are isomorphic. | Easy | Likely | hash-tablestring | Solve |
Minimum Cost to Make Array Equal You are given two 0-indexed arrays nums and cost consisting each of n positive integers. | Hard | Likely | arraybinary-searchgreedy | Solve |
Beautiful Arrangement Suppose you have n integers labeled 1 through n. A permutation of those n integers perm (1-indexed) is considered a beautiful arrangement if for every i (1 <= i... | Medium | Likely | arraydynamic-programmingbacktracking | Solve |
Minimum Time to Repair Cars You are given an integer array ranks representing the ranks of some mechanics. ranksi is the rank of the ith mechanic. A mechanic with a rank r can repair n car... | Medium | Likely | arraybinary-search | Solve |
Chalkboard XOR Game You are given an array of integers nums represents the numbers written on a chalkboard. | Hard | Likely | arraymathbit-manipulation | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Likely | arraytwo-pointerssorting | Solve |
Container With Most Water You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). | Medium | Likely | arraytwo-pointersgreedy | Solve |
Koko Eating Bananas Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. | Medium | Likely | arraybinary-search | Solve |
Next Permutation A permutation of an array of integers is an arrangement of its members into a sequence or linear order. | Medium | Likely | arraytwo-pointers | Solve |
Edit Distance Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. | Medium | Likely | stringdynamic-programming | Solve |
Maximum Points Inside the Square
SolveYou are given a 2D array points and a string s where, points[i] represents the coordinates of point i, and s[i] represents the tag of point i.
Minimize Length of Array Using Operations
SolveYou are given a 0-indexed integer array nums containing positive integers.
Count the Number of Powerful Integers
SolveYou are given three integers start, finish, and limit. You are also given a 0-indexed string s representing a positive integer.
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Maximum Subarray
SolveGiven an integer array nums, find the subarray with the largest sum, and return its sum.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Group Anagrams
SolveGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Jump Game
SolveYou are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
Jump Game II
SolveYou are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.
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.
Maximum Product Subarray
SolveGiven an integer array nums, find a subarray that has the largest product, and return the product.
Isomorphic Strings
SolveGiven two strings s and t, determine if they are isomorphic.
Minimum Cost to Make Array Equal
SolveYou are given two 0-indexed arrays nums and cost consisting each of n positive integers.
Beautiful Arrangement
SolveSuppose you have n integers labeled 1 through n. A permutation of those n integers perm (1-indexed) is considered a beautiful arrangement if for every i (1 <= i...
Minimum Time to Repair Cars
SolveYou are given an integer array ranks representing the ranks of some mechanics. ranksi is the rank of the ith mechanic. A mechanic with a rank r can repair n car...
Chalkboard XOR Game
SolveYou are given an array of integers nums represents the numbers written on a chalkboard.
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Container With Most Water
SolveYou are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
Koko Eating Bananas
SolveKoko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.
Next Permutation
SolveA permutation of an array of integers is an arrangement of its members into a sequence or linear order.
Edit Distance
SolveGiven two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent HashedIn interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
HashedIn interviews focus heavily on array, dynamic-programming, string 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. HashedIn 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.
HashedIn has been reported to ask 21 distinct coding problems. The most common topics are array, dynamic-programming, string. 2 are Easy difficulty, 15 are Medium, and 4 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 21 reported problems, HashedIn interviews are in line with industry averages - 19% Hard vs 18% overall. 71% 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, dynamic-programming, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real HashedIn coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a HashedIn interview with AIarrow_forward
