Baidu

10 questions tracked9 with solutions

🔍

Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough

Showing 10 of 10 questions

HardArithmetic Slices II - Subsequence✓ Our Solution

100

ArrayDynamic Programming

HardBinary Tree Maximum Path Sum✓ Our Solution

Dynamic ProgrammingTreeDepth-First SearchBinary Tree

MediumLongest Substring with At Least K Repeating Characters✓ Our Solution

Hash TableStringDivide and ConquerSliding Window

MediumInteger Replacement✓ Our Solution

Dynamic ProgrammingGreedyBit ManipulationMemoization

HardSplit Array Largest Sum✓ Our Solution

ArrayBinary SearchDynamic ProgrammingGreedy+1

MediumArithmetic Slices✓ Our Solution

ArrayDynamic ProgrammingSliding Window

StringDynamic ProgrammingStackBreadth-First Search+1

MediumOut of Boundary Paths✓ Our Solution

Dynamic Programming

HardDesign In-Memory File System

Hash TableStringDesignTrie+1

MediumLength of Longest Fibonacci Subsequence✓ Our Solution

ArrayHash TableDynamic Programming