LeetCode 904: Fruit Into Baskets | Java Solution | Sliding Window Technique

In this problem, we need to find the maximum number of fruits we can collect into two baskets, where each basket can only hold one type of fruit. #slidingwindow #twopointertechnique #leetcode #javainterviewprep ⏱️ Time Complexity: O(n) - where n is the number of fruits 🗃️ Space Complexity: O(1) - we store at most 3 fruit types at any time ## ⏰ Timestamps 00:00 - Understanding problem statement 01:30 - Discuss more examples 02:17 - Sliding window approach 03:10 - Dry run 05:17 - Big O Notation calculated 05:48 - Java code walk-through 07:13 - Solution analysis - runtime + memory 07:21 - Conclusion ## 🔑 Key Concepts Covered • Sliding Window Technique • Two-Pointer Approach • HashMap for Frequency Counting • Optimization for Space Complexity ## 💡 Learning Points • How to implement a sliding window with variable size • Efficiently tracking elements in a window using HashMap • Optimizing space complexity for constrained problems • Converting logical constraints into efficient code ## 🔗 Related Problems • LeetCode 3: Longest Substring Without Repeating Characters • LeetCode 159: Longest Substring with At Most Two Distinct Characters • LeetCode 340: Longest Substring with At Most K Distinct Characters • LeetCode 1004: Max Consecutive Ones III ## 👨‍💻 Target Audience Developers preparing for coding interviews with a focus on sliding window problems and intermediate algorithm techniques. ## 📚 Prerequisites • Basic Java programming knowledge • Understanding of arrays and collections • Familiarity with hash maps and two-pointer techniques ## 🔗 Important Links • Problem statement: https://leetcode.com/problems/fruit-into-baskets/ • Solution code: https://leetcode.com/problems/fruit-into-baskets/solutions/7050305/sliding-window-solution-in-java-with-video-explanation ## 💡 Additional Tips • Pay attention to the implementation of the sliding window to handle variable sizes • Focus on managing the space complexity by limiting the number of types tracked • Consider how this approach applies to other "at most K distinct elements" problems ## 🙏 Call to Action If you found this solution helpful, please subscribe to the channel for weekly coding interview problem solutions! Drop your questions and alternative approaches in the comments below. #codinginterviews #javaprogramming #leetcodesolutions