Huawei Interview Questions — 15 DSA Problems

15 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Huawei LeetCode questions for software engineering interviews.

• Minimum Number of Visited Cells in a Grid (HARD) — Array, Dynamic Programming, Stack, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix, Monotonic Stack
• Maximum Binary String After Change (MEDIUM) — String, Greedy
• Two Sum (EASY) — Array, Hash Table
• Valid Parentheses (EASY) — String, Stack
• Decode String (MEDIUM) — String, Stack, Recursion
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Combination Sum (MEDIUM) — Array, Backtracking
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• 24 Game (HARD) — Array, Math, Backtracking
• Largest Number (MEDIUM) — Array, String, Greedy, Sorting
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
• Maximal Rectangle (HARD) — Array, Dynamic Programming, Stack, Matrix, Monotonic Stack