oanaunciuleanu 23 Iun. 2020 1 min Minimum Cost Path in Matrix In a matrix you have to find the minimum cost path to reach the last cell from the first one, meaning that starting from the top left...

oanaunciuleanu 21 Iun. 2020 2 min Minimum Cost Polygon Triangulation in C++ Having a given polygon, divide it using triangulation between all points, having the minimum cost. This means that we have to divide the...

oanaunciuleanu 28 Mai 2020 1 min Maximum Length Chain of Pairs in C++ The maximum length chain of pairs is a variation of the longest increasing subsequence problem. We have to find the pairs of numbers that...

oanaunciuleanu 27 Mai 2020 1 min Longest Increasing Sub-sequence in C++ Using this algorithm we can find the longest increasing subsequence from a given array. This means that we will find the numbers that are...

oanaunciuleanu 25 Mai 2020 2 min Longest common subsequence algorithm in C++ Having two strings, you have to find the longest common subsequence. This means that you have to find how many letters are found in both...

oanaunciuleanu 20 Mai 2020 2 min Floyd Warshall Algorithm in C++ This algorithm is used to find the shortest path between all pairs of vertices, including negative edges. // Floyd-Warshall Shortest...

oanaunciuleanu 19 Mai 2020 2 min Collect maximum points in a grid using two traversals in C++ Using a grid of cells that hold values, try to find the maximum number of points that can be summed by using two traversals. The first...