Thank u sir 🙏

can do using hash map. More efficient

thank you

❤

AWESOME Explanation bro..

WOW

❤

My initial guess, if using C/C++, is to quicksort the characters in the string, then you scan through and look for successive characters that are equal.

Hai bro very nice explanation

Yeah an array is a data structure. So that's terrible. You failed the interview. So sad. So bad.

Sounds to me like one solution would be using two for loops .... for every character, look ahead in second for from the next byte/char to last and see if that character shows up again ... if it does, your string is not unique. Another solution , if you're allowed to modify the original string, is to run a sort on it.. again, if you find two characters that are identical it's a bad string. You'll need a temporary variable to use to swap characters during sort, but that should be allowed, because you'll have temporary variables for the for loops anyway, no way around it.

But after concat we are accessing changed value only then the purpose of being immutable not served right? As by any means user is accessing changed value not the old one

Thank you

Nice

Nice 👍👍

It's clear , and how about prinitives data type ? Are Java primitives immutable?

Good video

Done mil gaya

thanks so much

thank my bro

2023 now but i'm watch video

😍😍😍😍

Bhai apney concept shi se nhi smjha, ye aesey nhi hoga, apney code voh gayle lokmam mackdowell vali book se same to same teep diya hai

I am getting error it is saying change modifier of "btn00" to final. Can you tell me any suggestions?

How You get acces to btn in CheckWinner method? I cant use btn like You

Very helpful!

THE BEST EVER !!!!

Hey bro, Can you please help me create a draw method if nobody wins. like when the whole board is full, I want to say Draw. How can I do it? Pleas help.

confusion hi confusion

Its simple and helpful

buddy can u provide source code

Very helpful video and explanation! Thank you

We can do with object as well

what part of " Without Using An Additional Data Structure" is not clear ? you used Boolean Array !!

Nice Lecture👍

Best nd easiest way jst like sidhi baat no bkwaas😘

Bro u deserve a million subs, Ur explanation is Superbbb

Confused.

What's ur ide

i didn’t understand the concept of adding static at 6:28 could you pls explain in what situations we need to add it and what situations we neednt? thanks

Really osm brother

Thanks bro🔥🔥🔥 its better than cramming things

I think, instead of str[trueLength] = '\0' it should be str[index] = '/0'. NO?

Bhaiya class 12 isc ka methods chapter kr do pls mere paper hai plzzz..... If u can do plz reply

Keep continue... It is too helpful bcoz the way u explain in easy language is effective

👏👏

Instead get the sum of ASCII values of each character in both the strings and check if their sum is equal or not

if you don't consider charcheck array as an additional data structure, why don't we go ahead and use HashSet instead. 1--> we traverse through the string and add every Character to the HashSet. 2--> so, HashSet doesn't allow duplictaes. 3--> after traversing we use an if Condition to check the Hash Set Size. 4--> if Hash Set size is equal to the length of the string we return true(which means there is no duplicates), else we return false(duplicates are present). please reply . is my method correct

You are using the additional data structure but please go through the problem statement.

Bro it's very nice🥳clear understand keep rocking bro