Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK

[@Anonymous-bg7if]

sir in editorial this problem was solved using stringstream , it would be great if you explain a little bit about stringstream in next potd video.

[@codestorywithMIK]

Hey there, Oh i didn’t notice that. But yes indeed stringstream can be used to solve this. I will make a separate video on stringstream. But meanwhile, search stringstream in this link - github.com/MAZHARMIK/Cpp-STL-Quick-Help You will get to know a lot of things

[@amanpaliwalvlogs6860]

Radhe Radhe ❤

[@codestorywithMIK]

Radhe Radhe Aman ❤️😇🙏

[@AkhileshChouhan-d4v]

Great content

[@codestorywithMIK]

🙏❤️😇

[@MohammedHasmi577]

Sir i am biggest fan of you❤

[@aws_handles]

Me too bro 😁

[@piyush0mandloi]

Thank you sir

[@JagannathDebGunin]

Dada,Can you please make a video on Sieve of eratosthenes?

[@codestorywithMIK]

Oh yes yes. My bad i missed to update on this. This video is almost ready, just needed some editing and corrections. Will upload this week for sure ❤️

[@oppo-px5hf]

@@codestorywithMIK yes need video on this plz

[@aws_handles]

yes please

[@best4567]

class Solution { public: string addSpaces(string s, vector& spaces) { int n = spaces.size(); for(int i=0 ; i

[@cabbi9]

Please cover yesterday’s CF contest’s question C

[@hellsterkun8764]

Was able to solve today's question by writing code into a story, just as you taught us, Mik Sir❤ P.S.: Sir, please check your mail and revert back if possible.

[@codestorywithMIK]

Awesome. My bad i might have missed the email. Can you please resend it ?

[@HumanBeing-m1x]

please make video on manacher algorithm for longest palindrome string and also make video on z algorithm

[@aizad786iqbal]

khud se kar liya but iska runtime kaafi high tha class Solution { public String addSpaces(String s, int[] spaces) { StringBuilder sb = new StringBuilder(s); int count = 0; for(int x : spaces){ sb.insert(x+count, ' '); count++; } return sb.toString(); } }

[@hike_explorer]

EYES ON THE HOLE -MOTIVATION

[@CHANDANKUMAR-ck3is]

bhaya isn't like using the + while concatinating the string takes much space there ?

[@christopherhenry981]

bhaiya can u make a video to find no of nodes at a distance k from given node in tree

[@DrOnZeR2022]

Just use dfs and a count pointer every time u visit a node just update the count and when count is equal to k then return in this way u Can find no of nodes at a distance k .U can also use bfs that is easier than this

[@AryanVats603]

my code string addSpaces(string s, vector& spaces) { int j=0; string ans=""; for(int i=0;i

[@paragbansal3]

Esa same code mene java me Kiya toh tle aa raha hai

[@codestorywithMIK]

Please share your core once. Let’s check

[@AryanVats603]

write condition for pointer on spaces array also..coz u might be accessing array index beyond array size

[@jain5184]

why i got memory limit exceed

[@codestorywithMIK]

Please share your core once. Let’s check

[@AryanGupta-2024]

@@codestorywithMIK class Solution { public: string addSpaces(string s, vector& spaces) { string ans=""; int c=0; for(int i=0;i

[@jain5184]

@@codestorywithMIK hello sir class Solution { public: string addSpaces(string s, vector& spaces) { string ss =""; int j = 0; for(int i = 0 ; i

[@jeehub041]

Bhaiya I think Time complexity would be just O(n) because we are using if condition which is O(1).❤