233. Longest Repeating Character Replacement

Write a function solve that, given a string s and an integer k, returns the length of the longest substring where you can replace at most k characters to make all characters the same.

Example:
Input: s = 'ABAB', k = 2
Output: 4

Run this challenge interactively in Python or JavaScript when the app loads.