Problem database last updated: June 20, 2025
15 problems · 3 Easy, 9 Medium, 3 Hard · Ranked #107 of 458
3 Easy
20% · avg 23%
9 Medium
60% · avg 59%
3 Hard
20% · avg 18%
Based on 15 reported problems, Huawei interviews are in line with industry averages - 20% Hard vs 18% overall. The majority (60%) 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, Huawei puts unusual emphasis on monotonic-stack (20% of problems, 6.9x the industry average), union-find (13.3% of problems, 4.5x the industry average), stack (33.3% of problems, 3.9x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (60%), string (40%), dynamic-programming (33.3%), stack (33.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Minimum Number of Visited Cells in a Grid You are given a 0-indexed m x n integer matrix grid. Your initial position is at the top-left cell (0, 0). | Hard | Very Likely | arraydynamic-programmingstack | Solve |
Maximum Binary String After Change You are given a binary string binary consisting of only 0's or 1's. You can apply each of the following operations any number of times: | Medium | Very Likely | stringgreedy | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Decode String Given an encoded string, return its decoded string. | Medium | Very Likely | stringstackrecursion | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Very Likely | stringstack | 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 |
Generate Parentheses Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. | Medium | Very Likely | stringdynamic-programmingbacktracking | Solve |
Merge Two Sorted Lists You are given the heads of two sorted linked lists list1 and list2. | Easy | Likely | linked-listrecursion | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Combination Sum Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum... | Medium | Likely | arraybacktracking | Solve |
Maximal Rectangle Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. | Hard | Likely | arraydynamic-programmingstack | Solve |
Daily Temperatures Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait aft... | Medium | Likely | arraystackmonotonic-stack | Solve |
Largest Number Given a list of non-negative integers nums, arrange them such that they form the largest number and return it. | Medium | Likely | arraystringgreedy | 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 |
24 Game You are given an integer array cards of length 4. You have four cards, each containing a number in the range [1, 9]. You should arrange the numbers on these car... | Hard | Likely | arraymathbacktracking | Solve |
Minimum Number of Visited Cells in a Grid
SolveYou are given a 0-indexed m x n integer matrix grid. Your initial position is at the top-left cell (0, 0).
Maximum Binary String After Change
SolveYou are given a binary string binary consisting of only 0's or 1's. You can apply each of the following operations any number of times:
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Decode String
SolveGiven an encoded string, return its decoded string.
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
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.
Generate Parentheses
SolveGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Merge Two Sorted Lists
SolveYou are given the heads of two sorted linked lists list1 and list2.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Combination Sum
SolveGiven an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum...
Maximal Rectangle
SolveGiven a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.
Daily Temperatures
SolveGiven an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait aft...
Largest Number
SolveGiven a list of non-negative integers nums, arrange them such that they form the largest number and return it.
Maximum Subarray
SolveGiven an integer array nums, find the subarray with the largest sum, and return its sum.
24 Game
SolveYou are given an integer array cards of length 4. You have four cards, each containing a number in the range [1, 9]. You should arrange the numbers on these car...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Huawei interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Huawei interviews focus heavily on array, string, dynamic-programming 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. Huawei 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.
Huawei has been reported to ask 15 distinct coding problems. The most common topics are array, string, dynamic-programming. 3 are Easy difficulty, 9 are Medium, and 3 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 15 reported problems, Huawei interviews are in line with industry averages - 20% Hard vs 18% overall. 60% 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, string, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Huawei coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Huawei interview with AIarrow_forward
