Sweta BarmanDynamic Programming : Number of ways to.….When it comes to solving questions asking for the number of ways to be king of the world, or something simpler — the number of ways to…·2 min read·Dec 28, 2020----
Sweta BarmanDynamic Programming and the partition problemThe first thing to note about Dynamic Programming is that — you cannot memorize the patterns! Memoize, but do not memorize!·4 min read·Dec 21, 2020----
Sweta BarmanJeff Erickson’s book on algorithmsI’d started to get bored of leetcode. I could not bring myself to solve another leetcode problem. After all, it did not serve any higher…1 min read·Dec 16, 2020----
Sweta BarmanSkip Lists — let’s make it simple!What are skip lists? The idea is actually quite intuitive. Let’s look at a real life example : You are travelling from Algoland (an…·3 min read·Dec 4, 2020----
Sweta BarmanLeetcode #1167 Minimum cost to connect sticksIf you notice the problem closely — what you need is a sorted list of the array everytime. What better data structure to use than a heap?1 min read·Nov 10, 2020----
Sweta BarmanLeetcode #763 Partition LabelsA string S of lowercase English letters is given. We want to partition this string into as many parts as possible so that each letter…1 min read·Nov 10, 2020--1--1
Sweta BarmanEdit distance variant — shortest common super-sequenceThe motivation for this problem came from Steven Skiena :2 min read·May 11, 2020----
Sweta BarmanEdit distance variant — Longest common subsequenceThe longest common subsequence is a very popular DP problem whereby we try to figure out the longest common subsequence between two strings1 min read·May 11, 2020----
Sweta BarmanEdit distance variant — longest common substringWe take a look at a variant of the Longest common subsequence problem — which is the longest common substring problem.1 min read·May 11, 2020----
Sweta BarmanEdit distance variant — interleaving stringsWe take a look at another variant of the edit distance problem — Interleaving strings.2 min read·May 11, 2020----