LeetCode 647 Palindromic Substrings - Three Solution from O(n³) to O(n) - (Med, Java)
647. Palindromic Substrings When tackling LeetCode 647 (Palindromic Substrings), there are multiple ways to solve the problem. Today, I'll walk through three distinct approaches: the Brute Force method, the Expand Around Centers technique, and the a...
Written by
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.