Huawei LeetCode interview questions

Explore Huawei questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 13

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Minimum Number of Visited Cells in a Grid Array Dynamic Programming Stack +5 HARD	Hard	100.0%	0.2%
Maximum Binary String After Change String Greedy MEDIUM	Medium	100.0%	0.5%
Two Sum Array Hash Table EASY	Easy	76.3%	0.6%
Valid Parentheses String Stack Bracket Sequences EASY	Easy	76.3%	0.5%
Longest Increasing Subsequence Array Binary Search Dynamic Programming +1 MEDIUM	Medium	76.3%	0.6%
Number of Islands Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	66.5%	0.7%
Generate Parentheses String Dynamic Programming Backtracking +1 MEDIUM	Medium	66.5%	0.8%
Longest Palindromic Substring Two Pointers String Dynamic Programming +1 MEDIUM	Medium	66.5%	0.4%
N-Queens Array Backtracking Algorithm X HARD	Hard	66.5%	0.8%
Trapping Rain Water Array Two Pointers Dynamic Programming +2 HARD	Hard	66.5%	0.7%
Linked List Cycle Hash Table Linked List Two Pointers +1 EASY	Easy	66.5%	0.6%
Top K Frequent Elements Array Hash Table Divide and Conquer +5 MEDIUM	Medium	66.5%	0.7%
Single Number Array Bit Manipulation EASY	Easy	66.5%	0.8%

Showing 1–13 of 13 matching problems · All Problems

Huawei LeetCode Interview Questions | Grind Practice