Відео

This is the LeetCode daily September 14, 2024. In this video, we talk about a property of XOR and how it helps us solve the problem. Timecodes: 0:00 - Intro 0:12 - Walking through an example 6:38 - Solving the problem 12:57 - Code

You can also find a nice explanation of this problem on this medium article medium.com/@gismetmajidov/binary-search-part-3-continued-pattern-to-solve-leetcode875-koko-eating-bananas-413acd49ce33 Timecodes 0:00 - Problem description 0:48 - Drawing explanation 10:52 - Code

The Euclid's algorithm, also known as Euclidean algorithm, is an algorithm for finding the greatest common divisor (GCD) of two integers numbers . Timecodes 0:00 - Intro 0:22 - Examples 0:46 - Dry run of the algorithm 1:28 - The pseudocode 1:44 - A trick to remember the formula 2:45 - A direct proof of the formula

A nice problem to practice prefix sum and binary search and also the use case of module operator.

If you like the video, please consider subscribing to the channel as it helps more people find out about this channel. And also please don't forget to give it a like.

As a challenge problem, you could try solving the problem "2256. Minimum Average Difference", which is very similar to this problem.

If you have any questions or any problems you want me to consider, please write them down in the comments section. I'll be happy to help.

This is the first video on this channel. I hope you enjoyed it!.