Namma 3 while loops separate ah use pandrom bro, nested loops ah use panala, so tc O(3n) varum, common ah atha O(n) nu than solluvom while (condition): while (condition): while(condition): **Any code** ipdi irunthathan O(n^3) varum bro, nammaloda code while(condition) any code while(condition) any code while(condition) any code ithu ungaluku understand aahum nu ninaikiren bro
best data structure tutor in Tamil.....☺
brother your videos are extremely useful, thanks a ton❤
first i saw this video is not understandable ,after watching 3 to 4 times ,it is a perfect video with super explanation.Thank you bro
Super explanation bro
Thank you bro🎉
bro neenga 3 while loops use panirikeenga time complexity o(n*3) thana varum
Namma 3 while loops separate ah use pandrom bro, nested loops ah use panala, so tc O(3n) varum, common ah atha O(n) nu than solluvom
while (condition):
while (condition):
while(condition):
**Any code**
ipdi irunthathan O(n^3) varum bro, nammaloda code
while(condition)
any code
while(condition)
any code
while(condition)
any code
ithu ungaluku understand aahum nu ninaikiren bro
@@codemeal semma bro
Thookam varlaiya bro 🥱
neenga enga coding learn panninga bro?
Leetcode problems podunga bro
🎉❤ perfect
bro leetcode video podunga plsss
Sure
second and third while loop oda concept pureyala
merge and sort:
arr1=[4,2,5]
arr2=[6,1,3]
time complexity=o(n)
space ccomplexity=o(n)
how to possible?
Not O(n) bro NlogN varum
@@codemeal illa bro na geeksforgeeks website la parthen this problem...
@@codemeal ok but one array use panni Mergesort pannalam .. Two arrays use panni epadi Mergesort pandrathu..
Instala dm pannunga bro soldren