# Posts

👋 Sign in for the ability to sort posts by relevant, latest, or top.
Practicing algorithms using Polyglot Notebooks - part 3 - helpers

## Practicing algorithms using Polyglot Notebooks - part 3 - helpers

Practicing algorithms using Polyglot Notebooks - part 2 - introduction

## Practicing algorithms using Polyglot Notebooks - part 2 - introduction

Distinct Subsequence Leetcode

## Distinct Subsequence Leetcode

Shortest Common Super-sequence Leetcode (Same as Lcs string)

## Shortest Common Super-sequence Leetcode (Same as Lcs string)

Minimum number of Insertion and deletion needed to convert String A to String B or make both the strings equal (same as lcs)

## Minimum number of Insertion and deletion needed to convert String A to String B or make both the strings equal (same as lcs)

Rod cutting Problem (similar to unbounded knapsack)

## Rod cutting Problem (similar to unbounded knapsack)

Coin Change 2 Leetcode

## Coin Change 2 Leetcode

Coin change Leetcode

## Coin change Leetcode

0/1 Knapsack Problem GeeksForGeeks both bounded and Unbounded

## 0/1 Knapsack Problem GeeksForGeeks both bounded and Unbounded

Length of Longest Common Subsequence (LCS) and Longest common subsequence string leetcode

## Length of Longest Common Subsequence (LCS) and Longest common subsequence string leetcode

Count Palindrome Sub-Strings of a String GeeksForGeeks

## Count Palindrome Sub-Strings of a String GeeksForGeeks

Maximum Sum Problem GeeksForGeeks

## Maximum Sum Problem GeeksForGeeks

Partition Equals Subset Sum Leetcode problem or Subset sum equals to target

## Partition Equals Subset Sum Leetcode problem or Subset sum equals to target

Jump game II leetcode problem

## Jump game II leetcode problem

House Robber leetcode problem

## House Robber leetcode problem

Number of longest common subsequence

## Number of longest common subsequence

Leetcode-42: Trapping Rain Water

## Leetcode-42: Trapping Rain Water

Azure Data and AI Certification Overview

## Azure Data and AI Certification Overview

Maximum subarray in dynamic programming in Nim

## Maximum subarray in dynamic programming in Nim

LeetCode: Maximum Sum Circular Subarray

## LeetCode: Maximum Sum Circular Subarray

Learn Dynamic Programming using Fibonacci as an example