Baidu LeetCode interview questions

Explore Baidu 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 / 10

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Binary Tree Maximum Path Sum Dynamic Programming Tree Depth-First Search +2 HARD	Hard	100.0%	0.4%
Longest Substring with At Least K Repeating Characters Hash Table String Divide and Conquer +1 MEDIUM	Medium	100.0%	0.5%
Integer Replacement Dynamic Programming Greedy Bit Manipulation +1 MEDIUM	Medium	100.0%	0.4%
Split Array Largest Sum Array Binary Search Dynamic Programming +2 HARD	Hard	100.0%	0.6%
Arithmetic Slices Array Dynamic Programming Sliding Window MEDIUM	Medium	100.0%	0.6%
Arithmetic Slices II - Subsequence Array Dynamic Programming HARD	Hard	100.0%	0.6%
Zuma Game String Dynamic Programming Stack +2 HARD	Hard	100.0%	0.3%
Out of Boundary Paths Dynamic Programming MEDIUM	Medium	100.0%	0.5%
Design In-Memory File System Hash Table String Design +2 HARD	Hard	100.0%	0.5%
Length of Longest Fibonacci Subsequence Array Hash Table Dynamic Programming MEDIUM	Medium	100.0%	0.6%

Showing 1–10 of 10 matching problems · All Problems

Baidu LeetCode Interview Questions | Grind Practice