Non-Russian speakers may find this of limited interest.
> The English version of the website is a work in progress; the only useful thing you can find here is the continuously updated draft of Algorithms for Modern Hardware. We are currently more focused on the Russian version [...]
Unless you grind leetcode problems, it is unlikely one could solve them in 30 minutes (you are supposed to cheat). For example, see whether you can come up with Manacher's algorithm (or any other O(n) solution in 30 minutes https://en.wikipedia.org/wiki/Longest_palindromic_substring#... (the example is from the real interview for senior position (implies multiyear programming experience)). I could see a dynamic programming solution (quadratic) be implemented in 30 minutes but not O(n). Try it for yourself.
It’s useful for employers though, it’s a good indicator of who is the most desperate to work there; for certain roles and companies a higher than usual level of desperation seems a necessary prerequisite.
It’s a leveller. People who haven’t had the benefits of working with the exact stack on the same type of problem in another similar company still get a shot. Do you have the drive and enough mental acuity to solve this set of problems? You’ll figure out the stack and job.
> The English version of the website is a work in progress; the only useful thing you can find here is the continuously updated draft of Algorithms for Modern Hardware. We are currently more focused on the Russian version [...]