Meet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
1Find Longest Palindromic Substringmedium
Based onLeetCode
mediumBlind 75
Longest Palindromic Substring
There are 2n-1 centers in a string. I expand outward from each one and keep the longest mirror that holds.
StringTwo PointersDynamic Programming
Chat with Fin or Coco right now on mobile.
Start talking through the problem here. Switch to desktop when you're ready to code and run tests.
Start coaching sessionMeet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
Start coached rep
Start a coached rep now. Guest text is free. Sign in if you want this work on another device.
or
Email me this coached-rep link
1Find Longest Palindromic Substringmedium
Based onLeetCode
Code + tests need a desktop
Chat works on this phone. Email yourself a link when you want the editor and tests.