Algorithms - Bellman-Ford and Floyd-Warshall - shortest paths with negative weights and all-pairs

Intro   At the moment I am looking for a job, so in my research into coding test platforms, the problems that cannot be solved with just a little thinking and some loops are 80% covered by just 8 categories of problems: Optimization with overlapping subproblems (coin change, longest increasing subsequence, knapsack variants, matrix chain) - solved with Dynamic Programming (memoization/tabulation). Pathfinding, connectivity, or level-order processing in grids/graphs (number of islands, sh...