Видео

damn you made it look like 1 == 2 :3

finally someone explained tideman in an understandable way, thank you for giving me clarity. I have read the disclaimer, I wont copy your code, in stead I feel confident, that I can use recursion technique now.

SURPRISINGLY I AM WATCHING IT ON THE SAME DAY YOU MADE THIS and i found out by looking at the date on you laptop it wass really trippy ..

i find a solution in chat gbt four but did'nt understand anything , when i watch your vedio i understand it soo good thank you brother

I ended up receiving the answer from chatgpt, as I didn't want to research anything and I was already confused by the explanation... if I had found your channel in time, I would have done it without researching... :( . (Now I'm going to read and understand what he told me, even if it's cheating, I'm going to research and clear all my doubts and also understand the logic of his video, especially the lock_pairs part, where I was confused and couldn't...) I didn't want to get the answer... sorry.

Thank you for the video, wondering what's your vscode's theme?

How do you load the image?

I don't think your code is totally correct, what if while looping through locked[i][winner] the are two locked pairs which are true and the first one leads to the cycle. Your code skips the first and store the winner after that, which might not necessarily lead to the cycle. For example, if we had 6 candidates {0, 1, 2, 3, 4, 5, 6} and the graph goes like 5 -> 1 3 -> 5 2 -> 5 1 -> 2 " 1 -> 2" creates a cycle but when your code is looping locked[i][winner] in has_cycle function for this, it gets to 2-> 5, makes winner = 2 which is the path that leads to the cycle, but then changes winner = 3 which doesn't lead to the cycle before checking if winner = 2 leads to a cycle. Hope i'm making sense 😅

Simply illuminating. Its 2024 now and this by far is the most indepth explanation video for the Tideman problem set I've ever came across. I finally understood the concept at the 1:00:00 mark. Thank you and subscribed!

Man it was tough to visualize but this video helped me understand the question in a much clearer way. I do have prior programming experience, however with the lack of more advanced ds, it does become really difficult. Now I appreciate OOPs!

It's [tidiman], not [taidman]

You can add a function per time section for tideman .

Thanks you for taking some of your time to do this videos for begginers, cheers from Brasil!

well done for this. i have question for recover, why did you put number 100 in "char filename[100];"

Thanks for the great explanation! Tideman was really challenging and you make it looks much more easy!

I got stuck in the locked array part, this was a amazing solution. Thank you😊

Thanks for the subtle explanation! Helped a lot!

Awesome, for a very long time I struggled to find a better solution than brute force for this problem! This is it!

I have watched over five videos explaining recursion, and you are the best and clearest programmer in delivering the concept.

Amazing Bro, thank you very much!!!!!

Chutia explanation bc

This editor looks cool. What is it?

Perfect perfect perfect. I felt like I was keeping track of four different arrays and lists in my head. Your thought process was the best out of the eight videos i’ve seen for this problem. Thank you you’re the best!

are u indian?

Excellent Explanation. I love his details. He literally visualize every action with given examples. Love you Man!

somehow i kinda did it at the same time im still confuse how the 3 for loops work

Doesn't work

I don't know what to do! I've finished this pset on my own two days ago, i'm sure 110% that my code is working (i've compared it in all the possible ways with the solutions of the staff) but as soon as i run the CS50 check in the terminal all allerts are red! I'm sure my code is fine. What can i do? at this point how can i contact cs50 in order to solve this technical problem? i don't want to submit it becuase, with this technical error (which is not mine) I could compromise my total score in the course so far.

THANK YOU SO MUCH !!!!

22:24

Great video mate, really helped visualise the problem

Thank you for the clear explanation of the Luhn algorithm from 36:19 🙏

At 1:03:30 the condition for the first loop should be i < candidate_count - 1.

the sepia doesnt work with me i literally copy pasted it after many tries to do it on my own and it still doesnt work it compiles with no errors but it just returns the normal photo can u please help me find whats wrong

hey man, I need help :/ I'm stuck at this exercise.. I've done this exercise by myself, without browsing for videos.. and it worked very well, all my results were the same of the staff. even valgrind didnt return any leak of memory to me. but when I use check50, I just can't pass on the last check.. it says that my code isnt free of memory errors, and the output is the next one: :( program is free of memory errors expected "MISSPELLED WOR...", not "### unhandled ..." I did and remade my code, over and over again, I saw lot of videos to try to find out what was my mistake.. and after seeing your video I thought my problem would be done, I did exactly what you did, and the error persists.. what do I do?... please, I don't like to see errors in my code :b obs: my code is almost the same of yours but the hash function, i used a simples one that calculates the index of the letter in the alphabet..

thanks ur video made me understand nested for loops

thank you!!

1:04:24 why this ++? Where is this 1 being added? How? I can't understand it, and I an't find any video that explains this. How are we supposed to solve this if the lectures don't give us any clue about the problems?

in 1:38:00 when back tracing reaches to bob and bob is the loser of the new pair we are finding out whether to create a cycle or not, why would we skip david -> bob pair? I know that it creates a cycle but this cycle does not affect the source of the graph which is alive. I am really confused here since CS50 accepted this algorithm.

Thank you!! this really helped me understand how it works!

Why in sql 10 you can just select distinct name, how is that different with the 9 one

thx

36:17 the best😂😂😂

Why did using the “w” operator not overwrite the stuff in current_file if found_jpeg is true?

THANKS BRO!

I wonder how you went straight to submitting your code 32:32 before checking other tests or even trying check50. Brother, your code results grade3 in the first test only. To avoid getting other people into trouble, make it a habit to check50 before submitting. Also, you need to know about basic functions like (round) and (re) at least they have been indicated in the problem set. Coding/programming in general is all about testing all probabilities.

I couldn't solve add_pairs() function although my code is the same with your code.

How do you fit more than two elements into a bucket, with those lines? else{ new_node -> next = table[index] } implies that if the location is full, then it point to that location. Does that not mean that the second location will be replaced, if the second location is already full? I feel like the check needs to iterate over until it finds a null, rather than simply assuming the next location is already free?

i don`t know what the actual hell is going on with my code but my hastable magically becomes NULL inside the check function, if i print its contents right before the return in load function it`s all in there but then if i print it in the 1st line of the check function it`s null!!! OBS: only when using the small dictionary

Awesome... great knowledge of Python and really very good and understandable explanations.