I liked your video and commented because you made the list super easy and said if you don’t watch the whole thing that’s oke or something. Id made me want to like. More of you would be great for the world!! Have a good life 💪

I love your vids

at 10:00, memo[1] and memo[2] are not stored in the memo array isn't it, those 2 comes from the base case of the recursive function, if n==1 or f==2 return 1

On the Jupyter color coding, my "print" command loses its green status as soon as I start typing the left paren that follows. It still performs the instruction as intended. Is this a minor bug or is there some detail here I'm missing, that's of any significance later?

Thank you for the excellent video. As a programmer with 50 years of experience, I must say that we have lost touch with algorithms in the sense I discuss in my articles on Medium: "Bagels and Muffins of Programming or How Easy It Is to Convert a Bagel into a Black Hole" Thinking algorithmically and living in an algorithm-centric world of software engineering, creating muffin-like programs, is now the domain of a few solitary individuals. Today's programming world increasingly focuses on a code-centric approach, where algorithms are not seen as separate entities. This shift has led to significant changes in how we develop and maintain software. There was a time when algorithms were at the heart of any program, providing a clear and understandable structure for development. They helped us build logical and efficient solutions. However, with the rise of high-level programming languages and frameworks, the emphasis shifted to quickly writing code and implementing new features, often at the expense of structured algorithmic thinking. Nowadays, we often encounter bagel-like programs where the code exists separately from the algorithm, creating internal inconsistencies and maintenance difficulties. In such conditions, achieving stability and reliability in software becomes challenging. Returning to an algorithm-centric approach and creating muffin-like programs, where the algorithm and code are integrated, can significantly improve the quality of software. This will not only simplify testing and maintenance but also allow for more flexible and resilient systems. I hope more developers will begin to recognize the importance of algorithms and move towards a more structured and meaningful approach to programming. Only in this way can we create software that is reliable, understandable, and easy to maintain.

imma be real, while this has been a great series so far, HOW AM I SUPPOSED TO KNOW WHAT THE TEMP FUCNTION IS IF YOU NEVER TAUGHT US IT UNTIL AFTER YOU'VE SHOWN THE SOLUTION?????

Thank you very much for the video and lesson, it did clear some of my doubts regarding for loops that I have for a very long time.

Ive gone through so many Big O videos and even this one I still dont get, like where are these formulas coming from Im not even sure what it is Im not grasping...

I love this program and how to develop app using this

How he makes red arrow, square and zoom in?

Your videos are amazing.. pls do more on advanced topics too..very clear explanation.. ur thebest

anyone in 2024................................</>

0:28

This is silly: import time d = ['Apple(fruit)', 'Banana', 'Microsoft', 'Apple', 'Linux'] x=0 y=0 z=1 for i in d: while y <= 5: print(f"The item is: {d[x]} [{z}]") x=x+1 time.sleep(0.2) if x == 5: x=0 y=y+1 z=z+1

As a computer science major. How can you become a software engineer?

csdojo you the boy

Thank you bro

I have a masters in computer science, and this is the first time I've seen this concept explained this well. Had you been my prof way back, I'd definitely have gotten better funding in grad school!

It's crazy that this doesn't get famous!

getting error on labels? TypeError: 'str' object is not callable

Thanks a lot Yk. For sharing this valuable tips. 👀💖🍀

*Frog problem in Kotlin* 🐸🌊 fun count(n: Int): Int{ when (true){ (n >2) -> return count(n-2) + count(n-1) (n == 2) -> return 2 (n == 1) -> return 1 else -> return 0 } } fun main() { println(count(11)) //prints "144" }

Thanks for the insight!

Another video misleading people about what big-O is, because the lecturer doesn't know himself what it is.

Would appreciate if you could make a follow up video on the same topic in today's context where there is proliferation of LLMs

This video is wonderful

your teaching damm good 🎉🎉

This is awesome thank you!

are you amazing?

Thank you

I never knew those things thank you

def sumOfnumber(): total1 = 0 for i in range(1, 100): if (i % 3 == 0) or (i % 5 == 0): total1 += i return total1 total2 = sumOfnumber() print(total2)

Sem 1 break 2024.UPNG

if you got struggled with the nested for loops, consider that for a in range(4): print("CS dojo") ==> CS dojo CS dojo CS dojo CS dojo

Thanks YK. Your video is really helpful and i see you want to help everyone, human man kind and in the path of success of mankind where we all are on same page without inequalities. Thank you. I really want to discuss some tech career topic with, for some experienced person. Where i can connect with you.

Is there anyone here who can help me with my test

The best definition of an algorithm that I've come across is as follows : An algorithm is a set of steps or instructions on how to complete a task. In computing, an algorithm is a set of steps that a program takes to complete a task.

The best definition of a data structure that I've ever come across is as follows : A data structure is an organisation, management and storage format that enables the efficient access and modification of data. More precisely, a data structure is a collection of data values, the relationship among them, and the operations that can be applied to those data values.

Indeed, you're a great teacher. Thank you!

int fib(int n){ if (n <= 1){ return 1 } else { return fib(n-1) * fib(n-2); }

I was so confused reading the university notes on DP. But now after this video, it all makes so much more sense. I've learned a few algorithms using DP but it's mostly because I understood the logic somehow, but as for DP, I didn't try to understand that particular concept much. Now I feel more confident about it. Thanks a lot!

It's been a while since I did this - so came here for a refresher. Very helpful and neatly explained. Quite liked the way you illustrated the concept. Keep 'em coming! :)

Thank you detailed concise explanation.

#task: adding all multiples of 3, 5 less than 100 #defining variables for calculating sum of multiples of 3,5 and 15 indivitually rf3 = 0 rf5 = 0 rf15 = 0 #calculating the variables for i in range(1,100): if i%3 == 0: rf3+=i if i%5 == 0: rf5+=i if i%15 == 0: rf15+=i #calculating reuired result r = rf3 + rf5 - rf15 print(r)

Docspython.org for sale

so which one of three different approaches is actually considered 'dynamic programming'? The last one? All of them? The question what is dynamic programming and what is not remains open for me...🤔

1:34 that's so cute

So computer science is better than software engineering in software engineering, Cool!

Pls correct me if I'm wrong, but it should be def convert(miles): return 1.6*miles convert(2) 3.2 convert(4) 6.4 Etc

What is r1. I am so confused. But nice wideo