Matt Timmermans questions

Matt Timmermans answers

• Binary Search algorithm implementations
• Get X amount of integers that can all be multiplied together to get close to Y
• Bijection between (n choose k) and bitstrings of length n with k bits set
• How best to split a file into N parts with M redundant parts such that any N of the N+M parts is sufficient to reconstuct it?
• Why `async` doesn't inherit SupervisorJob if called directly inside the coroutine block?
• Fast way of detecting outliers in 2D space
• Best suited data-structure for prefix based searches
• Fastest algorithm to detect duplicate files
• How to find out if a set of point3D are in the same plane?
• Fastest way to determine if a uint64 has been "seen" already