---
title: "Discussion on \"LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))\" | Hashnode"
description: "Discussion on \"LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))\". Unavoidable O(n²) - Optimal Solution in Python, Java, Golang, C, C#, C++"
url: "https://hashnode.com/posts/leetcode-daily-challenge-3477-fruits-into-baskets-iieasy-on/68917ae6f2dbd648272e4d13"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))](https://huanganni.hashnode.dev/leetcode-daily-challenge-3477-fruits-into-baskets-iieasy-on?utm_source=hashnode&utm_medium=feed)

Unavoidable O(n²) - Optimal Solution in Python, Java, Golang, C, C#, C++

Aug 5, 2025 · 4 min read · huanganni.hashnode.dev  
Read the article

-   [#daily-leetcode-challenge](https://hashnode.com/tag/daily-leetcode-challenge)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#leetcode-easy](https://hashnode.com/tag/leetcode-easy)

## Written by

[Anni Huang](https://hashnode.com/@HuangAnni)

@HuangAnni · Singapore

  
[View profile](https://hashnode.com/@HuangAnni)

LLM Training Operation Specialist @ ByteDance | Ex-Master of IT in Business (AI track) at SMU

I’m Anni Huang, an AI researcher-in-training currently at ByteDance, specializing in LLM training operations with a coding focus. I bridge the gap between engineering execution and model performance, ensuring the quality, reliability, and timely delivery of large-scale training projects.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
