Welcome, Guest

Back to Sheets/Huawei Master DSA Sheet

Huawei Master DSA Sheet

This compilation contains exclusive, previously asked data structure and algorithm questions from real Huawei interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.

top-specifichuawei-prep

Valid Parentheses

Easy

StackString

Maximum Binary String After Change

Medium

GreedyString

Generate Parentheses

Medium

BacktrackingDynamic ProgrammingString

Trapping Rain Water

Hard

ArrayDynamic ProgrammingMonotonic Stack

Longest Palindromic Substring

Medium

Dynamic ProgrammingStringTwo Pointers

Minimum Number of Visited Cells in a Grid

Hard

ArrayBreadth-First SearchDynamic Programming

Number of Islands

Medium

ArrayBreadth-First SearchDepth-First Search

Maximum Subarray

Medium

ArrayDivide and ConquerDynamic Programming

Two Sum

Easy

ArrayHash Table

Container With Most Water

Medium

ArrayGreedyTwo Pointers

Remove K Digits

Medium

GreedyMonotonic StackStack

Combination Sum

Medium

ArrayBacktracking

Decode String

Medium

RecursionStackString

Merge Two Sorted Lists

Easy

Linked ListRecursion

Merge k Sorted Lists

Hard

Divide and ConquerHeap (Priority Queue)Linked List

N-Queens

Hard

ArrayBacktracking

3Sum

Medium

ArraySortingTwo Pointers

Longest Increasing Subsequence6 Months

Medium

ArrayBinary SearchDynamic Programming

Linked List Cycle

Easy

Hash TableLinked ListTwo Pointers

24 Game

Hard

ArrayBacktrackingMath

Huawei Master DSA Sheet

All Questions