Канал: Code Brownie

Rod cutting problem - Dynamic programming

Rod cutting problem - Dynamic programming

Matrix chain multiplication - memoization

Matrix chain multiplication - memoization

Matrix chain multiplication -Dynamic Programming

Matrix chain multiplication -Dynamic Programming

Rod cutting problem - memoization

Rod cutting problem - memoization

Rod cutting problem - Tabulation

Rod cutting problem - Tabulation

BFS - Coding up the shortest path

BFS - Coding up the shortest path

BFS - Shortest path on an Unweighted graph

BFS - Shortest path on an Unweighted graph

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

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

Introduction to BFS

Introduction to BFS

Understanding Breadth First Search algorithm

Understanding Breadth First Search algorithm

Longest common subsequence | Space optimisation for linear space complexity

Longest common subsequence | Space optimisation for linear space complexity

Longest common subsequence - Tabulation

Longest common subsequence - Tabulation

Longest common subsequence | Coding up the memoization solution

Longest common subsequence | Coding up the memoization solution

Longest common subsequence | Theory | Dynamic programming

Longest common subsequence | Theory | Dynamic programming

Graph representation - Adjacency matrix

Graph representation - Adjacency matrix

Graph representation - Adjacency list

Graph representation - Adjacency list

Introduction to graph algorithms

Introduction to graph algorithms

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

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

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

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

Dynamic Programming | 2xN Domino tiling

Dynamic Programming | 2xN Domino tiling

Longest increasing subsequence | Theory

Longest increasing subsequence | Theory

Merge two sorted arrays | Two pointer

Merge two sorted arrays | Two pointer

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

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

Introduction to Binary Search | The art of search space elimination

Introduction to Binary Search | The art of search space elimination

Binary search | Lower Bound

Binary search | Lower Bound

Binary Search | Inverse of a monotonic function

Binary Search | Inverse of a monotonic function

Coding up Your First Binary Search Problem

Coding up Your First Binary Search Problem

Longest Increasing Subsequence | Memoization | Dynamic programming

Longest Increasing Subsequence | Memoization | Dynamic programming

Coding up your first memoization problem | Fibonacci series

Coding up your first memoization problem | Fibonacci series

Longest increasing subsequence | Tabulation | Dynamic programming

Longest increasing subsequence | Tabulation | Dynamic programming

Memoization vs Tabulation - Dynamic Programming | Part 2

Memoization vs Tabulation - Dynamic Programming | Part 2

Memoization vs Tabulation - Dynamic Programming | Part 1

Memoization vs Tabulation - Dynamic Programming | Part 1

Approaching a dynamic programming problem - part 3

Approaching a dynamic programming problem - part 3

Approaching a dynamic programming problem - part 2

Approaching a dynamic programming problem - part 2

Approaching a dynamic programming problem - part 1

Approaching a dynamic programming problem - part 1