After a long time....Finally I found the best channel to learn DSA.. Thanks a lot... explain all the things u learned.. Time taken doesn't matter to us
if you take time also no problem this video stay forever, so give the content max,, learning always consume time.. we want from your channel deep knowledge
Bro, thanks for making, however ignore okva it make break the continuity and Don,t underestimate viewers cannot understand in this or that. try to teach as teacher which best way for understand the learners. I hope you take as sportive . Thanks for your initiative and you are making available who needs to contact you that is great think.
Thanks for your appreciation bro.. Sure I will try not to include that in between... I am just teaching content infront of the laptop assuming it as a viewer thats why in the flow it is coming frequently... Anyway in upcoming videos I will sort it out.. Once again thank you bro ✨️
@codemeal unga teaching super bro.can you prefer any reading materials or books for reference bcz na oru starter Reference ku helpfula erukum pls prefer a simple and understandable book bro i am a beginner.
I spent money on courses but everything went in vain. You have made me understood this topic in very simple terms along with a practice program to understand it better. May I ask how can I contact you, brother?
Bro, I just tried the practice problems. pls check whether is it right or not. Question1 Time complexity: O(n) Space complexity: 0(n) Question2 Time complexity: O(n^2) Space complexity: O(n^2) Question3: Time complexity: O(n) Space complexity: O(n)
@@codemeal Okay bro.. All the best for placements.. Juss waiting for videos.. and one small suggestion bro.. i am able to come up with time complexity.. but not with space.. Space complexity mattum epdi kandu pudikarudhunu oru video pota nalarkum bro..
Thank you bro.. time and space complexity ku oru video already potrupen bro athu paarunga apdi purilana telegram la enaku msg panunga na exaplain pandren bro
0(logx) complexity la x oda value 4 ah iruntha log4=0.602.Oru programme 1 time run agalam and also n time run agalaamnu sonninga where n is a natural number.But,0.602 times oru programme eppidi run aagum bro.And also 0.602 is almost equal to 1.Then why not the time complexity is O(1) constant time.
Yes bro neenga soldrathu correct... but x oda value 4 nu irukanala ungaluku runtime less than 1 kidaikuthu... oru velai x oda value oru large number ah iruntha ans kandippa 1 ah vida greater ah irukum eg: log100 = 2... intha case la namma itha O(1) nu solla mudiyathu but O(n) num solla mudiyathu.... so intha maari iruka case ellam logN time complexity la run aahum bro... time complexities ellame namma worst case vachu than decide pananum bro.... ithu understand aahum nu namburen bro
Practice Problems: Qn No 1: Input=5 Result=1 for i in range (1, Input+1): Result-Result*i print (Result) Time Complexity: o(n) Space Complexity: o(1) Qn No 2: Input="Hello" List=[] for i in range(0,len(Input)): for j in range(0, len (Input)): List.append([Input[i], Input[j]]) print (List) Time Complexity: o(n^2) Space Complexity: o(n) Qn No 3: Input=10 for i in range (1, Input+1): print(i) print (Input) print (Input) print (Input) print (Input) print (Input) Time Complexity: o(n) Space Complexity: o(1)
