3399. Smallest Substring With Identical Characters II (Leetcode Hard)

preview_player
Показать описание
Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!

#leetcode #coding #programming
Рекомендации по теме
Комментарии
Автор

Hey Larry, for this problem, I think it is much easy if first you handle the edge case "101010...." and "010101...". if the ops that changes to these two special cases <= numOps, you can return 1. Then the binary search for the rest group could be much simpler.

wallyyu
visit shbcf.ru