Code Brownie

Approaching a dynamic programming problem - part 1

Merge k sorted arrays | O(NKlog(K))| Priority Queue | Divide and Conquer

Merge two sorted arrays | Two pointer

BFS - Shortest path on an Unweighted graph

Approaching a dynamic programming problem - part 1

Coding up your first memoization problem | Fibonacci series

Longest increasing subsequence | Theory

BFS - Coding up the shortest path

Longest common subsequence | Space optimisation for linear space complexity

Introduction to Binary Search | The art of search space elimination

Dynamic Programming | 2xN Domino tiling

Rod cutting problem - memoization

Pair with a given sum in a sorted array | Two pointer

Graph representation - Adjacency list

Introduction to graph algorithms

Longest common subsequence | Theory | Dynamic programming

Matrix chain multiplication - memoization

Coding up the BFS algorithm | O(V+E)

Meet in the middle | Number of quadruples with a given sum

Matrix chain multiplication -Dynamic Programming

Rod cutting problem - Dynamic programming

Understanding Breadth First Search algorithm

Rod cutting problem - Tabulation

Longest common subsequence | Coding up the memoization solution

Longest common subsequence - Tabulation

Introduction to BFS

Graph representation - Adjacency matrix