1963. Minimum Number of Swaps to Make the String Balanced - Day 8/31 Leetcode October Challenge

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
Рекомендации по теме
Комментарии
Автор

Were you able to swap things into the right place?

Algorithmist
Автор

Day 8 of solving leetcode problems till i get a job.. I couldn't able to solve this one.... Thank you for your explanation.

jegadheeswarank
Автор

Truggke with it for hours :( How could you come up that it's a Greedy problem so fast ?

khongduocbocuoc
Автор

Thanks for sharing, I guess it's not even necessary to keep track of the number of swap, and it's enough to return the depth/2 since it's the number of duplicates opening [ that refer to those with a permutation plus theirs mirror (original)

algo-architect