• from What are some of the algorithms we should know before taking system design interviews?

books

• Grokking Algorithms: An illustrated guide for programmers and other curious people

courses

• The Last Algorithms Course You'll Need by ThePrimeagen | Preview
  • https://frontendmasters.com/courses/algorithms/

Concepts

• Brute Force - look at all the possibilities and selects the best solution
• Greedy - choose the best option at the current time, without any consideration for the future
• Divide and Conquer - divide the problem into smaller parts and then solve those parts
  • combinations-permutations
• dynamic-programming - build up a solution using previously found sub-solutions
• Backtracking - similarly to brute force, try to generate all possible solutions, but each time you generate next solution you test if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise, backtrack, and go on a different path of finding a solution. Normally the DFS traversal of state-space is being used
• Branch & Bound - remember the lowest-cost solution found at each stage of the backtracking search, and use the cost of the lowest-cost solution found so far as a lower bound on the cost of a least-cost solution to the problem, in order to discard partial solutions with costs larger than the lowest-cost solution found so far. Normally BFS traversal in combination with DFS traversal of state-space tree is being used

Graph theory

• https://en.wikipedia.org/wiki/Edge_contraction

Resources

• Protodash: https://medium.com/swlh/an-introduction-to-protodash-an-algorithm-to-better-understand-datasets-and-machine-learning-613c24b23719
• Sorting: https://medium.com/better-programming/5-basic-sorting-algorithms-you-must-know-9ef5b1f3949c
• memo Algorithms and data structures implemented in JavaScript with explanations and links to further readings
• A collection of algorithms written in javascript
• https://en.wikipedia.org/wiki/Spatial_database#Spatial_index
  • A spatial index is a data structure that allows for accessing a spatial object efficiently. It is a common technique used by spatial databases. Without indexing, any search for a feature would require a "sequential scan" of every record in the database, resulting in much longer processing time.
• Three Thousand Years of Algorithmic Rituals: The Emergence of AI from the Computation of Space tags.to-read
• Visualizing Algorithms tags.to-read
• https://en.wikipedia.org/wiki/Anytime_algorithm