oanaunciuleanu23 Iun. 20201 minMinimum Cost Path in MatrixIn 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...

oanaunciuleanu21 Iun. 20202 minMinimum 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...

oanaunciuleanu28 Mai 20201 minMaximum 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...

oanaunciuleanu27 Mai 20201 minLongest 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...

oanaunciuleanu25 Mai 20202 minLongest 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...

oanaunciuleanu20 Mai 20202 minFloyd Warshall Algorithm in C++This algorithm is used to find the shortest path between all pairs of vertices, including negative edges. // Floyd-Warshall Shortest...

oanaunciuleanu19 Mai 20202 minCollect 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...

oanaunciuleanu18 Mai 20201 minFibonacci Series in C++The Fibonacci series is a sequence of numbers where one item is the sum of the previous two numbers. The first 2 numbers are 0 and 1, so...

oanaunciuleanu13 Mai 20202 minBox stacking problem, Dynamic Programming in C++The box stacking problem is a variation of the Longest Increasing Subsequence problem. The statement is that we are given n types of...

oanaunciuleanu6 Mai 20202 minKruskal’s Minimum Spanning Tree Algorithm in C++A spanning tree is a subgraph of an existing graph that is a tree and connects all the nodes. There can be many spanning trees in a...

oanaunciuleanu4 Mai 20202 minPrim’s Minimum Spanning Tree Algorithm in C++A spanning tree is a subgraph of an existing graph that is a tree and connects all the nodes. There can be many spanning trees in a...

oanaunciuleanu30 Apr. 20201 minThe Minimum number of Coins Algorithm in C++An algorithm to find the minimum number of coins / banknotes for a specific value. // Number of coins #include <bits/stdc++.h> using...

oanaunciuleanu29 Apr. 20202 minBellman-Ford's shortest paths Algorithm in C++Using this algorithm, we find the shortest path from a node to all the other nodes in a weighted directed graph. It works with negative...

oanaunciuleanu28 Apr. 20202 minHuffman Coding and Decoding Algorithm in C++Huffman’s Coding algorithms is used for compression of data so that it doesn’t lose any information. Each symbol is converted into a...

oanaunciuleanu27 Apr. 20202 minDijkstra’s Shortest Path Algorithm in C++Dijkstra’s Shortest Path Algorithm is used to find the shortest path in a graph, from one node to every other node in a graph. Start with...

oanaunciuleanu24 Apr. 20201 minShell Sort Algorithm in C++Shell sort is a sorting algorithm that uses a gap between elements to compare the values. The gap between elements shrinks until is 0 and...

oanaunciuleanu22 Apr. 20202 minQuick Sort Algorithm in C++Quick sort is a recursive sorting algorithm. It uses the idea of divide et conquer. To solve the array, we have to choose a pivot, which...

oanaunciuleanu21 Apr. 20201 minPigeonhole Sort Algorithm in C++Pigeonhole is a sorting algorithm. It works best if the number of elements in the array and the number of keys is similar. It is a...

oanaunciuleanu20 Apr. 20202 minMerge Sort Algorithm in C++Merge Sort is a Divide and Conquer Algorithm. It continuously divides in 2 the array, and then each divided part and so on until we have...

oanaunciuleanu17 Apr. 20201 minInsertion Sort Algorithm in C++Insertion Sort algorithm is a sorting technique that arranges elements in an array. Many people compare it to the way that we sort...