Episode 125: Largest Substring Between Two Equal Characters

Episode 125: Largest Substring Between Two Equal Characters

From ArrayCast by Conor Hoekstra & Adám Brudzewsky

May 19, 2026 · 1h 49m

About this episode

Adam and Conor discuss the Largest Substring Between Two Equal Characters problem from PWC and LeetCode.

Adam and Conor chat about the problem from PWC 372 and LeetCode 1624: Largest Substring Between Two Equal Characters. Host: Conor Hoekstra Panel: Adám Brudzewsky Show Notes ArrayCast - May 18th, 2026 ArrayCast on Youtubearraycast.comArrayCast on BlueSkyPWC 372LeetCode 1624. Largest Substring Between Two Equal CharactersGitte ChristensenForgeTinyAPL SolutionsBQN SolutionUiua Solution

People in this episode

Host: Conor Hoekstra

Guest: Adám Brudzewsky

Topics covered

  • substring problem
  • algorithm
  • coding challenge
  • LeetCode
  • PWC
  • software development

Keywords

  • substring
  • equal characters
  • LeetCode 1624
  • PWC 372
  • algorithm
  • coding
  • software engineering

Mentioned in this episode

Organizations: PWC, LeetCode, Forge, TinyAPL Solutions, BQN Solution, Uiua Solution

Books & works: Largest Substring Between Two Equal Characters

More episodes of ArrayCast

Explore listener stats, chart rankings, contacts and more on the ArrayCast podcast page.