Hi Bro, Same idhae maaari advanced level coding questions podunga. Main ah more than 3 years experienced persons. Oru series maari potingana nusefulah irukum brother
I would request you to add time complexity for each method you try.. People will always choose the easiest way but end up with high time complexity. In 8th example, using formula - we achieved O(1) but if we use Set with has function it will take O(n). It would be good if you add this while solving the problems with different approaches. Simple request from a developer , thanks for understanding.
7th question : Finding the first non repeating character You have solved it using O(n*m) complexity and space complexity O(n) Why don't we try IndexOf() method using a single loop. For example i th index string - take it (s.substring(i+1) .IndexOf(s[i])) == -1 ) return s[i] - since it is not repated anywhere in substring.
Hi JVL, I have donated in gpay, Can I get an acknowledgement? And this series needs to continued. I saw the Full video.. Only on the deep clone still clarification is needed which I can do on my own. But pls continue doing this js related videos.
for angrams question 7 at 50:42 Write a function to check if two strings are anagrams.why this fn is less efficient any thoughts bro? function areAnagrams(str1, str2) { // Remove spaces and convert to lowercase let cleanedStr1 = str1.replace(/\s+/g, '').toLowerCase(); let cleanedStr2 = str2.replace(/\s+/g, '').toLowerCase();
// Sort the letters of both strings let sortedStr1 = cleanedStr1.split('').sort().join(''); let sortedStr2 = cleanedStr2.split('').sort().join('');
Hi Bro, Same idhae maaari advanced level coding questions podunga. Main ah more than 3 years experienced persons. Oru series maari potingana nusefulah irukum brother
En thalaivan vantan daaaa💥💥💥💥💥💥💥💥💥💥💥💥🔥🔥🔥🔥🔥🔥
Bro please continue to javascript DSA...Waiting
thalaivan is back....
I would request you to add time complexity for each method you try..
People will always choose the easiest way but end up with high time complexity.
In 8th example, using formula - we achieved O(1) but if we use Set with has function it will take O(n).
It would be good if you add this while solving the problems with different approaches.
Simple request from a developer , thanks for understanding.
Good and most waited content bro
👌🏼
7th question : Finding the first non repeating character
You have solved it using O(n*m) complexity and space complexity O(n)
Why don't we try IndexOf() method using a single loop.
For example
i th index string - take it (s.substring(i+1) .IndexOf(s[i])) == -1 )
return s[i] - since it is not repated anywhere in substring.
Thanks thala🔥🔥🤝
Mass Thala🔥🔥🔥
very useful bro.
Thanks bro ❤
Hi JVL,
I have donated in gpay,
Can I get an acknowledgement?
And this series needs to continued.
I saw the Full video..
Only on the deep clone still clarification is needed which I can do on my own.
But pls continue doing this js related videos.
Bro Nest js Tutorial potuga bro❤❤❤
Springboot full course podunga bro pls
Python questions podunga bro
Hi sir.pls springboot full course
Typescript full course video please
Spring boot full course
intha mari videos podunga anna
Bro please continue dsa in javascript
waiting JS DSA bro
Spring boot full course and project please anna
Report lab in django for pdf pathi video podunga bro..
Sir. Nest js tutorial full course..
brother Nest Js podunga
Bro nodejs micro service video venum bro and oru project bro
bro intha mari java kum video podunga
for angrams question 7 at 50:42 Write a function to check if two strings are anagrams.why this fn is less efficient any thoughts bro?
function areAnagrams(str1, str2) {
// Remove spaces and convert to lowercase
let cleanedStr1 = str1.replace(/\s+/g, '').toLowerCase();
let cleanedStr2 = str2.replace(/\s+/g, '').toLowerCase();
// Sort the letters of both strings
let sortedStr1 = cleanedStr1.split('').sort().join('');
let sortedStr2 = cleanedStr2.split('').sort().join('');
// Compare the sorted strings
return sortedStr1 === sortedStr2;
}
// Test cases
console.log(areAnagrams("listen", "silent")); // true
console.log(areAnagrams("race", "care")); // true
console.log(areAnagrams("hello", "world")); // false
Anna please python problem solving ku video podunga na coding
Springboot bro please
Bro react interview question podunga bro
bro where to get this type of question ?
Bro SQL full course
Nest js please bro
Apdiye angular Kum podu thala😢
Bro yenaku oru doubt bro athu naa insta solirukan konjam yenaku clear Pani vidunga bro🙏