Minimum Days GeeksForGeeks POTD 11 Feb | C++ Solution|
**************************
#potd #gfg #geeksforgeeks #balloon #ballooneverywhere
Hello Guys
Welcome to my YouTube Channel
Subscribe and click the bell icon to get notified.: http://bit.ly/_mahaveerYT
In this video we will be solving the POTD i.e. Problem of the day from the geeksforgeeks website.
Problem link:
https://practice.geeksforgeeks.org/pr...
Problem Code Github Link:
https://github.com/codewithgfg/GFG-PO...
Problem Statement = iven a string S of length N containing only lowercase alphabets. You are also given a permutation P of length N containing integers from 0 to N-1. In (i+1)'th day you can take the P[i] value of the permutation array and replace S[P[i]] with a '?'.
For example in day 1, we can choose index of permutation array is i=0 and replace S[P[0]] with '?'.
Similarly in day 2, we can choose index of permutation array is i=1. You can replace S[P[1]] with '?'.
Similarly in day 3,we can choose index of permutation array is i=2. You can replace S[P[2]] with '?'.
You can contact me here:
Instagram :
/ _mahaveer_18
Thanks for watching.
Please like, share and subscribe.
**************************
#c++Solutions #coding #programming #wave #gfgproblem #gfgproblemoftheday #10febgfg #dailysolutiongfg #potd #potdgfg #ballongfg #balloneverywhere #ballooneverywhere #ballooneverywheregfg #10febballoonproblemgfg
#array #programming #gfg #geeksforgeeks #problem #potd #coding #dsa #leetcode #balloon #ballooneverywhere #podtproblem #minimum #minimumdays #minimumdayspotd