Всё про Binary Search. Тотальный гайд для собеса в IT и Leetcode алгоритмов (уникальный из практики)

Telegram Post: https://t.me/koduryem/10 Telegram: https://t.me/koduryem Leetcode: https://leetcode.com/idfumg GitHub: https://github.com/idfumg C++: https://gist.github.com/idfumg/f8ae98... Py: https://gist.github.com/idfumg/c27ba3... Go: https://gist.github.com/idfumg/34e3c5... Anyone who has frequently encountered the problem of adequately explaining Binary Search with a practical focus, rather than "copy-paste code from "Random tutorial, write a simple search, add that you're a senior, and call it a day." :) But when you start using it in practice, it turns out that the loop termination conditions can change. Sometimes it's less or equal, sometimes less, sometimes not equal, and so on. Sometimes lo is less or equal to hi, sometimes lo is less than hi, sometimes lo + 1 is less than hi. I debugged infinite loops because lo or hi evaluate to the same value. In such cases, something usually starts with the senior-great "algorithms are crap and are not needed anywhere." All this can be easily avoided and forgotten. In the video, I described in great detail the only universal mechanism for Binary Search and all the necessary patterns that can be encountered in practice - in life, on Leetcode, at work. This is what I came to understand over time. Now it's not some strange algorithm for debugging, but a beautiful and pleasant way to solve various kinds of problems. I gave examples of this pattern on a huge number of problems from easy to hard. I didn't explain the problems in great detail, but it's clear that the patterns are the same; the main and only thing now is to see how we can divide our scope and decompose the problem, rather than fighting with the Binary Search implementation. Try to understand my thought process and solve them yourself. This way, you'll quickly learn how to solve them by practice. Binary Search is extremely common. I put in quite a bit of effort; I hope this will be of some use to someone :) Algorithms are interesting and not difficult. We try solving problems on Leetcode, we talk, we visualize solutions, and we learn something new. Solve: https://leetcode.com/problems/search-... https://leetcode.com/problems/find-fi... https://leetcode.com/problems/check-i... https://leetcode.com/problems/find-sm... er-greater-than-target/description/ https://leetcode.com/problems/arrangi... https://leetcode.com/problems/find-mi... https://leetcode.com/problems/search-... https://leetcode.com/problems/find-pe... https://leetc ode.com/problems/koko-eating-bananas/description/ https://leetcode.com/problems/single-... https://leetcode.com/problems/cutting... https://leetcode.com/problems/missing... https://leetcode.com/problems/path-wi... description/ https://leetcode.com/problems/minimum... https://leetcode.com/problems/kth-sma... https://leetcode.com/problems/search-... https://leetcode.com/problems/find-mi... #c++ #python #go #golang #binarysearch #programming #data_structures #algorithms #computerscience