## Dynamic Programming – Edit(Levenshtein) distance

In this article, we will look at using the above steps to arrive at a Dynamic Programming solution to the Edit Distance problem.

In this article, we will look at using the above steps to arrive at a Dynamic Programming solution to the Edit Distance problem.

A postmortem for Coders of the Carribean, a Codingame contest based on Pirates of the Caribbean.

In this article, we will look at using the above steps to arrive at a Dynamic Programming solution to the Longest Common Subsequence problem.

In this article, I will show the advantages of using a Dynamic Programming approach. Using an example, we will come up with an approach to find a DP solution.

A post-mortem for Fantastic Bits, a Codingame contest based on Quidditch from Harry Potter.

A postmortem for The Accountant, an optimization contest sponsored by Warner Bro.s for their upcoming movie "The Accountant" held by codingame

A postmortem for HyperSonic, a multiplayer AI bot contest based on the Bomberman theme held by codingame.

In this C++ tutorial, we see an easy way to prevent the compiler from making objects i.e noncopyable objects.

Macro trickery to find the offending file(s) and line(s) causing Memory Leak(s) without using a commercial program.

This post deals with the basic information you need to know to start using DLL's.