Count minimum Adj swap to make string palindrome | Step by step Solution in Hindi

Count minimum Adj swap to make string palindrome | Step by step Solution in Hindi | Java

Рет қаралды 7,033

3 жыл бұрын

Optimized Solution for Count minimum swap to make string palindrome in Hindi.
#datastructure,
#algorithem,
#computerscience
#prepareyourself
#java
#array
#geeksforgeekssolution
#leetcodesolution
#arraysolutioninhindi
#datastructureinhindi

Пікірлер: 15

@anuragshekhawat2541 Жыл бұрын

Thanks bro it helped a lot 🤟🤟🤟

@ROHITKADYANJI Жыл бұрын

Excellent explanations bro keep it up!!!!!

@prepareyourself7992 Жыл бұрын

Thanks a lot! Keep learning

@A_CupOf_Life 2 жыл бұрын

👍👍

@harshvardhanr5062 2 жыл бұрын

how does it ensure that the swaps are minimum in number. we are only swapping to match the character at r with the lth character. will there be a case that matching the lth character with rth character will have minimum swaps

@umesh6472 2 жыл бұрын

this will not give the minimum no. of adjacent swaps. as we are only making a palindrome and not keeping the swaps minimum. In the desired solution we have to check for a minimum of swaps used in making (both chars equal to left and both char equal to right). for example "aabbdccd" to make "daabbccd" it takes 4 swaps and for "abbdccda" it takes 6 swaps choosing the minimum will give us the desired answer as doing the first will give answer 7 and the second will give 10.

@shobhitgarg6897 2 жыл бұрын

why we need to swap k and k+1 and how does this step solve problem.

@prepareyourself7992 2 жыл бұрын

Hi Thanks for bringing this in highlight, Your question is valid actually I have kept title wrong. I will update the title. Please continue watching other videos.

@prepareyourself7992 2 жыл бұрын

For Counting the minimum swap we can swap k with r. For Example "mamad" minimum adj swap is 3 but minimum swap is 1. We hope we clearifed your doubt.