The hottest Combinatorics Substack posts right now

And their main takeaways
Category
Top Science Topics
Technology Made Simple 139 implied HN points 22 Nov 23
  1. God's Algorithm aims for the fewest moves possible in combinatorial games like Rubik's Cube.
  2. Researchers found God's Number for Rubik's Cube using techniques like partitioning, symmetry, and dropping optimality.
  3. Key strategies used were dividing the problem into smaller parts, leveraging symmetry to reduce work, and focusing on finding solutions within 20 moves instead of the best possible solution.
The Software & Data Spectrum 78 implied HN points 13 Apr 23
  1. Bayesian Statistics is used in various fields like Machine Learning, Engineering, Data Science, and more.
  2. Bayesian Thinking involves observing data, holding prior beliefs, forming hypotheses, gathering evidence, and comparing hypotheses.
  3. Probability is a way to measure belief strength, and calculating probabilities involves counting outcomes and using ratios of beliefs.
Technology Made Simple 39 implied HN points 07 Sep 22
  1. The post discusses a problem related to creating a suitable music playlist for a road trip, requiring a certain number of songs and buffer between repeats.
  2. It emphasizes the importance of dynamic programming, logic, and combinatorics in solving the mentioned playlist problem.
  3. The post also includes requests to engage with and share the newsletter, showcasing the value of community support and feedback.
Technology Made Simple 19 implied HN points 17 Jun 22
  1. When faced with a problem involving combinatorics, taking the time to read and analyze the question can provide crucial insights for a more efficient solving approach
  2. In the context of building max heaps from a list of integers, understanding the structure of heaps as complete binary trees allows for simplification of the problem into calculating combinations and values for left and right subtrees
  3. Calculating the values for the left subtree, such as height and number of nodes, can lead to a shift in the coding task complexity from generating heaps to conducting combinatorics
Technology Made Simple 19 implied HN points 15 Jun 22
  1. The post discusses a coding interview question about finding the number of distinct ways to create a max heap from a list of integers.
  2. It emphasizes the importance of practicing unique interview questions to prepare for a variety of challenges.
  3. The author shares personal anecdotes and encourages engaging with the content by sharing preferences for future topics.
Get a weekly roundup of the best Substack posts, by hacker news affinity:
Technology Made Simple 19 implied HN points 06 Jan 22
  1. Creating a brute force solution can guide towards an optimal solution, but in interviews, it's better to showcase understanding and move on to more effective approaches
  2. Greedy algorithms are straightforward and choose the best option at each step, making them applicable for optimization problems like arranging couples
  3. Optimal algorithms, like the greedy approach, can be efficient because they make choices based on immediate benefit, even though they may overlook long-term gains