Fruit Into Baskets: coding question

Available question text

Given an array of fruit types where you can pick from a contiguous sequence while carrying at most two distinct types (two baskets), return the maximum number of fruits you can collect. Equivalently, find the length of the longest contiguous subarray containing at most two distinct values.

Continue with questions that share topics or the same question type.

Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
Minimum Operations to Reduce X to Zero
Coding · Array · Binary Search · Hash Table
Accounts Merge
Coding · Array · Breadth-First Search · Depth-First Search
Alternating Groups II
Coding · Array · Sliding Window

Sources · 2 references

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 904. Fruit Into Baskets
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 5 records

Adobe
Fruit Into Baskets
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 79.4. This is not an interview probability.
View source
Amazon
Fruit Into Baskets
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 68. This is not an interview probability.
View source
Meta
Fruit Into Baskets
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026

Fruit Into Baskets

Available question text

Related questions

Fruit Into Baskets

Available question text

Related questions