Baidu Interview Questions — 10 DSA Problems
9 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Baidu LeetCode questions for software engineering interviews.
- Arithmetic Slices II - Subsequence (HARD) — Array, Dynamic Programming
- Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
- Longest Substring with At Least K Repeating Characters (MEDIUM) — Hash Table, String, Divide and Conquer, Sliding Window
- Integer Replacement (MEDIUM) — Dynamic Programming, Greedy, Bit Manipulation, Memoization
- Split Array Largest Sum (HARD) — Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum
- Arithmetic Slices (MEDIUM) — Array, Dynamic Programming, Sliding Window
- Zuma Game (HARD) — String, Dynamic Programming, Stack, Breadth-First Search, Memoization
- Out of Boundary Paths (MEDIUM) — Dynamic Programming
- Design In-Memory File System (HARD) — Hash Table, String, Design, Trie, Sorting
- Length of Longest Fibonacci Subsequence (MEDIUM) — Array, Hash Table, Dynamic Programming
B
Baidu
10 questions tracked9 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 10 of 10 questions
2Dynamic ProgrammingTreeDepth-First SearchBinary Tree
3MediumLongest Substring with At Least K Repeating Characters✓ Our Solution Hash TableStringDivide and ConquerSliding Window
4Dynamic ProgrammingGreedyBit ManipulationMemoization
5ArrayBinary SearchDynamic ProgrammingGreedy+1
6ArrayDynamic ProgrammingSliding Window
7StringDynamic ProgrammingStackBreadth-First Search+1
9HardDesign In-Memory File System
Hash TableStringDesignTrie+1
10ArrayHash TableDynamic Programming
