Question 1

Minimum Number of Visited Cells in a Grid — Huawei Interview Question

Accepted Answer

"Minimum Number of Visited Cells in a Grid" is a hard difficulty problem asked at Huawei interviews. It covers the following topics: Array, Dynamic Programming, Stack, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix, Monotonic Stack. You can practice it on LeetCode: https://leetcode.com/problems/minimum-number-of-visited-cells-in-a-grid

Question 2

Maximum Binary String After Change — Huawei Interview Question

Accepted Answer

"Maximum Binary String After Change" is a medium difficulty problem asked at Huawei interviews. It covers the following topics: String, Greedy. You can practice it on LeetCode: https://leetcode.com/problems/maximum-binary-string-after-change

Question 3

Two Sum — Huawei Interview Question

Accepted Answer

"Two Sum" is a easy difficulty problem asked at Huawei interviews. It covers the following topics: Array, Hash Table. You can practice it on LeetCode: https://leetcode.com/problems/two-sum

Question 4

Valid Parentheses — Huawei Interview Question

Accepted Answer

"Valid Parentheses" is a easy difficulty problem asked at Huawei interviews. It covers the following topics: String, Stack. You can practice it on LeetCode: https://leetcode.com/problems/valid-parentheses

Question 5

Decode String — Huawei Interview Question

Accepted Answer

"Decode String" is a medium difficulty problem asked at Huawei interviews. It covers the following topics: String, Stack, Recursion. You can practice it on LeetCode: https://leetcode.com/problems/decode-string

Question 6

Number of Islands — Huawei Interview Question

Accepted Answer

"Number of Islands" is a medium difficulty problem asked at Huawei interviews. It covers the following topics: Array, Depth-First Search, Breadth-First Search, Union Find, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/number-of-islands

#	Question Title	Difficulty	Frequency	Topics
1	Minimum Number of Visited Cells in a Grid	HARD	100.0	ArrayDynamic ProgrammingStack+5
2	Maximum Binary String After Change	MEDIUM	100.0	StringGreedy
3	Two Sum	EASY	91.4	ArrayHash Table
4	Valid Parentheses	EASY	83.3	StringStack
5	Decode String	MEDIUM	83.3	StringStackRecursion
6	Number of Islands	MEDIUM	77.9	ArrayDepth-First SearchBreadth-First Search+2
7	Generate Parentheses	MEDIUM	77.9	StringDynamic ProgrammingBacktracking
8	Combination Sum	MEDIUM	71.0	ArrayBacktracking
9	Merge Two Sorted Lists	EASY	71.0	Linked ListRecursion
10	Longest Palindromic Substring	MEDIUM	71.0	Two PointersStringDynamic Programming

Explore 450+ Companies

Companies

Huawei

Want to see more?

Huawei Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Huawei

Want to see more?

Huawei Interview Questions

Ai Assistant Kas