Available question text
Given an array of small positive integers (n ≤ 100, nums[i] ≤ 30), remove at most one element to maximize the product of the GCD and LCM of the remaining elements (empty array score = 0). The task is to compute and return that maximum factor score.
Related questions
Continue with questions that share topics or the same question type.
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Find and Count Maximum-Score Grid Paths
Coding · Dynamic Programming · Grids & Matrices
- Find Maximum Non-decreasing Array Length
Coding
- Find Score of an Array After Marking All Elements
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3334. Find the Maximum Factor Score of Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source