Minimum Number of Swaps to Make the String Balanced | Leetcode 1963

This video explains the Minimum Number of Swaps to Make the String Balanced problem from leetcode 1963. We need to count the imbalance pairs and find the minimum number of swaps needed to make the parenthesis valid. We will solve by stack method as well as with counting closing bracket imbalance optimal approach.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar
🔴 INSTAGRAM: / techdose_official
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

[@vamshikrishnak6690]

Found this account and loved it

[@techdose4u]

great :)

[@sailendrachettri8521]

Day 8 Completed :)

[@techdose4u]

nice :)

[@UNKNOWN-qm6vc]

why we are doing [imbalance + 1/2] why we are adding +1??

[@techdose4u]

to take ceil function.

[@karthikk7136]

Sir, what notes app you're using?

[@Prakash-jh7hp]

is that optimal solution correct , i did not get the correct answer . private static int optimal(String s){ int closing=0; int maxclosing=0; for(char c : s.toCharArray()){ if(c=='['){ closing--; } else{ closing++; } maxclosing=Math.max(maxclosing, closing); } return (maxclosing+1)/2; } im getting 1 as output for the input "[ ]" but we should get 0 . did i made something wrong?

[@WebDevAnjali]

it IS resulting 0 as an output try clearing cache reset the code n submit

[@techdose4u]

try flushing memory

[@АндрейОдинцов-г3у]

гений

[@techdose4u]

Спасибо