Problem intelligence

Maximum Sum of 3 Non-Overlapping Subarrays

HARD · 6 companies · Array · Dynamic Programming · Prefix Sum · Sliding Window

Interview priority

54

medium

Target overlap

0/0

Recency

80

Trend

50

Frequency

59

Company observations

Amazon90d21.2
Amazon6m14.3
Amazonolder12.5
Amazonall15.7
Bloombergolder15.4
Bloombergall13.4
General Motorsolder52.8
General Motorsall59.4
Googleolder18.9
Googleall26.3
Metaolder27.7
Metaall36.8
Microsoftolder14.1
Microsoftall16.1

Why this score

unsolved100
recent activity80

Local progress

unseen

Open on LeetCode