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
  1. Programming Live with Larry
  2. coding
  3. programming
  4. interview
  5. programming interview
  6. leetcode
Рекомендации по теме
3398, 3399. Smallest 0:26:05

3398, 3399. Smallest Substring With Identical Characters I & II | 3398 I | Binary Search | !Gree...

Leetcode 3398 and 0:16:33

Leetcode 3398 and 3399 | Smallest Substring With Identical Characters | Weekly Contest 429

3399. Smallest Substring 1:03:05

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

Leetcode Weekly 429 0:12:50

Leetcode Weekly 429 | 3399. Smallest Substring With Identical Characters II | Binary search

3399. Smallest Substring 0:16:52

3399. Smallest Substring With Identical Characters II || Leetcode weekly contest 429 #leetcode

3399. Smallest Substring 0:18:45

3399. Smallest Substring With Identical Characters II

Weekly Contest 429 0:30:11

Weekly Contest 429 | 3396, 3397, 3398 and 3399 | Leetcode

Is CP dead 1:50:59

Is CP dead with O3 Coming? LIVE Leetcode Weekly 429 + Biweekly 146 Discussion | Community Classes

MySql Database 3 1:19:39

MySql Database 3

Комментарии
Автор

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
welcome to shbcf.ru