Question 1

Arithmetic Slices II - Subsequence — Baidu Interview Question

Accepted Answer

"Arithmetic Slices II - Subsequence" is a hard difficulty problem asked at Baidu interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/arithmetic-slices-ii-subsequence

Question 2

Binary Tree Maximum Path Sum — Baidu Interview Question

Accepted Answer

"Binary Tree Maximum Path Sum" is a hard difficulty problem asked at Baidu interviews. It covers the following topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. You can practice it on LeetCode: https://leetcode.com/problems/binary-tree-maximum-path-sum

Question 3

Longest Substring with At Least K Repeating Characters — Baidu Interview Question

Accepted Answer

"Longest Substring with At Least K Repeating Characters" is a medium difficulty problem asked at Baidu interviews. It covers the following topics: Hash Table, String, Divide and Conquer, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters

Question 4

Integer Replacement — Baidu Interview Question

Accepted Answer

"Integer Replacement" is a medium difficulty problem asked at Baidu interviews. It covers the following topics: Dynamic Programming, Greedy, Bit Manipulation, Memoization. You can practice it on LeetCode: https://leetcode.com/problems/integer-replacement

Question 5

Split Array Largest Sum — Baidu Interview Question

Accepted Answer

"Split Array Largest Sum" is a hard difficulty problem asked at Baidu interviews. It covers the following topics: Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/split-array-largest-sum

Question 6

Arithmetic Slices — Baidu Interview Question

Accepted Answer

"Arithmetic Slices" is a medium difficulty problem asked at Baidu interviews. It covers the following topics: Array, Dynamic Programming, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/arithmetic-slices

#	Question Title	Difficulty	Frequency	Topics
1	Arithmetic Slices II - Subsequence	HARD	100.0	ArrayDynamic Programming
2	Binary Tree Maximum Path Sum	HARD	97.8	Dynamic ProgrammingTreeDepth-First Search+1
3	Longest Substring with At Least K Repeating Characters	MEDIUM	97.8	Hash TableStringDivide and Conquer+1
4	Integer Replacement	MEDIUM	97.8	Dynamic ProgrammingGreedyBit Manipulation+1
5	Split Array Largest Sum	HARD	97.8	ArrayBinary SearchDynamic Programming+2
6	Arithmetic Slices	MEDIUM	97.8	ArrayDynamic ProgrammingSliding Window
7	Zuma Game	HARD	97.8	StringDynamic ProgrammingStack+2
8	Out of Boundary Paths	MEDIUM	97.8	Dynamic Programming
9	Design In-Memory File System	HARD	97.8	Hash TableStringDesign+2
10	Length of Longest Fibonacci Subsequence	MEDIUM	97.8	ArrayHash TableDynamic Programming

Explore 450+ Companies

Companies

Baidu

Baidu 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

Baidu

Baidu Interview Questions

Ai Assistant Kas