Available question text
Find the largest positive integer k such that both k and -k occur in the given nonzero integer array; return that k or -1 if none exist. This reduces to checking element presence (e.g., via a set) and selecting the maximum positive match.
Related questions
Continue with questions that share topics or the same question type.
- Form Largest Integer With Digits That Add up to Target
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Maximum Count of Positive Integer and Negative Integer
Coding
- Coding test: Given a simple mockup implement that UI. Some CSS is already provided and an API to fetch the data also exists. The recruiter prep doc talked about structuring the code well, making sure all functions work, write CSS and write tests. There is no way you can do it all in 1 hour, so it's probably best to ask the interviewer what they expect
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 2441. Largest Positive Integer That Exists With Its Negative
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source