HackerRank - Repeated String | Full Solution with Simplified Examples and Visuals | Study Algorithms 

crisp and clear ! thankss

great and clear explanation sir!!Thank you so much sir Not only this sir,each and every video was awesome and easily understandable

No one can explain like you ☺

bro you're just amazing👌👌.we want this type of teaching.

Great explanations, thank you

Really clear explanation. Definitely helped to understand this interesting HackerRank problem and the optimal solution. Many thanks!!

10 out of 10 explanation 🌼️, tysm!

Thank you Sir, you taught it very well.

I love you man!

StringLeftLength=n%strLength; Will be helpful?

Can you Please make it on Stock Span Problem

why is the time complexity O(1)? You have run the two loops in the code

Sir....I tried the below code.. #include #include using namespace std; int main() { long long int n,count=0; int length,i; string sub_str; getline(cin,sub_str); cin>>n; length = sub_str.length(); if(length==1) { if(sub_str[i]=='a') { count=n; } else { count=0; } } // finding number of a's in substring else if(length>1) { for(i=0;i

Why can't we use this stringLeftLength=n%strLength;

It still wasn't clear

Shouldn't you `Math.floor(n / sLength)` the number of reps?