Ones and Zeros Multiple (SPOJ / Polish Olympiad)
Given N, find the smallest multiple of N with only digits 0 and 1 in the decimal system. Let's solve this very old problem from Polish Olympiad in Informatics. I describe the solution in first 10 minutes, then it's mainly talking about implementation, proof of correctness, and alternative approaches. Surprisingly, we'll use graphs and BFS in this problem. You can submit your solution here https://www.spoj.com/problems/ONEZERO/. There's also a version with slightly higher limits https://szkopul.edu.pl/problemset/pro.... Subscribe for more educational videos on algorithms, coding interviews and competitive programming. Github repository: https://github.com/Errichto/youtube Live streams on 2nd YT channel and on Twitch: / errichto2 & / errichto FB and Twitter: / errichto & / errichto Frequently Asked Questions: https://github.com/Errichto/youtube/w... #Coding #Programming
Matrix Exponentiation + Fibonacci in log(N)
We're 99.9% sure this pattern is true, but no one can prove it
LeetCode Day 21 - Interactive Grid (Leftmost Column with 1)
Reinventing Entropy | Compression is Intelligence Part 1
Computations Modulo P in Competitive Programming
Algo Talk: Railroads from Facebook Hacker Cup
This C code should be ILLEGAL. It's also fantastic.
The Question Nobody Ever Explains: Where Does the Kernel End?
Maximal Square of Ones (LeetCode Day 27)
نتدرب ونجهز ازاي لل ECPC مع عدم وجود كوتش
C++ Bitsets in Competitive Programming
Dynamic Programming lecture #1 - Fibonacci, iteration vs recursion
The Strange Math That Predicts (Almost) Anything
The Story of the WORLD’s NO. 1 PROGRAMMER | A must-watch for every Programmer
Something is jamming GPS over Europe. Here's what we found
4 Distinct Digits | hard problem from Topcoder Open 2019
How I program C
POI problem Movie-goer | Polish Olympiad in Informatics
The Goat Problem - Numberphile
