Video

Unlock the full potential of your website with HEROXHOST's premium hosting services. Enjoy unmatched speed, security, and reliability. Your website deserves the best

Starting the Leetcode Journey

Im not able to find videos line by line

Nice proof. ❤❤

upcasting and downcasting should have been explained

Nice explanation with fabulous approach.

So wrong man

For java users here is the code class Solution { public String reverseWords(String s) { char []str=s.toCharArray(); String result="",w=""; int n=s.length(); int i=0,j=0; while(i<n) { while(i<n && str[i]==' ') i++; j=i+1; while(j<n && str[j]!=' ') j++; if(j<=n) {w=s.substring(i,j); if(result.isEmpty()) { result=""+w; } else result=w+" "+result; } i=j+1; } return result; } }

thee best video I ever had in this ques

By the way there was no need to swap;

this was best solution so far

how to set the normal c++ coding we learn this c++ is not easy to understand

Legendary playlist

i want full course

i want full course

THANK YOU SIR

Such a great explanation!

Best video on dynamic_cast, thank you sir!

"I've been with HEROXHOST for 3 years now, and they've consistently exceeded my expectations. From their intuitive control panel to their proactive security measures, they've made hosting stress-free for me."

NICE SUPER EXCELLENT MOTIVATED

terrible video can't understand a thing i came to learn about a term but this mf keep bomabarding a more hundred terms on me like tf is a static db. what is HTTP response and request. make sure if you are using a term not overone on the internet knows about that you already know. make me hate this subject more. Bravo!

I think you have to work on your English

At 3:12 'i' variable is looking for space and 'j' variable is looking for non space. Anybody Correct me if i am wrong?

wonderfulll solution, thanks

but it starts from a.begin and till d-1 as per your explanation, then why in code it is till d only?

Do they ask to solve in iterative way? it doesn't even seem efficient?

can you please let me know what is auto

thanks, amazing video

amazing video

hi, I solved this problem without giving regard to which task has higher frequency. I am just scheduling the first available task that is past the cooldown period. All test cases passed. I am using two maps one to keep frequency count and one to track the earliest possible time I can schedule the task next.

thank you sir the videos are really nice not skipping over the dferivations

This is desnecessarily complex.

Yoo check out my page I’m doing LeetCode in Swift

Thanks ❤

Hey man, a big critique for these videos is to please write more clear. A lot of time is spent trying to understand what you're writing.

One of my absolute favorite channels for leetcode problems... This might be the best one out there! :-)

wow the proof made everything clear. THANK YOU

Doesn't work if output "bb"

Time complexity will be O(nlogn)

great video

what is the use of odd found here? why do we put a check at the end?

Explanation not clear at all please improve narration

thanks

Thanks

Thanks

Thanks

Thanks

Thanks

Thanks

thanks