BarikZone

Number of Longest Increasing Subsequence | LeetCode 673 | Bottom UP | Dynamic Programming | DP

Asteroid Collision | LeetCode 735 | Stack

Matrix chain multiplication - top down dynamic programming

find median in a data strem

sliding window maximum

Find Median in a Data Stream || LeetCode 295

Count Inversions || Merge Sort Algorithm

power set bit manipulation

L6. Subsets II -- The Power Set (Duplicates) -- Recursion & Backtracking

L5: Subsets -- The Power Set -- Recursion & Backtracking

L4: Permutations II -- Permutations of Array -- Recursion & Backtracking

Next Permutation LeetCode

Preorder, Inorder, Post Order Traversal of a Binary Tree

Longest Common Subsequence - Top Down Memoization - Dynamic Programming [LeetCode 1143]

Reverse linked list recursively algorithm explained | left to right reversal

LeetCode 108. Convert Sorted Array to Binary Search Tree

Bitwise Operator | Bitwise AND, OR, Complement, Left Shift, Right Shift & XOR Operator Explained

First Missing Positive | LeetCode 41. First Missing Positive | Google Coding Interview Question

Longest Substring Without Repeating Characters || Leetcode 3 || Coding Interview Question

Reverse a String LeetCode

Integer Reversal | LeetCode Problem 7 || Dealing with Overflow || Linkedin Coding Interview Question

Range Sum of BST | LeetCode 938. Range Sum of BST | Binary Search Tree

Find All Duplicates in an Array | LeetCode 442

Reverse Bits || LeetCode 190 || Bit Manipulation

Rotate Image LeetCode|| Rotate 2D Matrix || Google Software Engineering Interview Question

LeetCode 111. Minimum Depth of Binary Tree | Minimum Depth of Binary Tree LeetCode

LeetCode 111. Minimum Depth of Binary Tree | Minimum Depth of Tree

LeetCode 44. Wildcard Matching | Wildcard Matching LeetCode | Wildcard Matching Dynamic Programming

Find Nth Node of a Linked List from End of List

Single Element in a Sorted Array LeetCode | LeetCode 540. Single Element in a Sorted Array

First Node of Loop in a Linked List ("On LeetCode" Cycle Linked List II) || Programming Interview

Remove Duplicates from Sorted Array (In-Place) -- Coding Interview Question

297. Serialize and Deserialize Binary Tree | LeetCode 297 | Serialize and Deserialize Binary Tree

Maximum Subarray LeetCode Explained || Maximum Sum of Contiguous Sub Array || LeetCode 53

0/1 Knapsack Problem - Top Down Memoization - Dynamic Programming - DP

Delete Node in a Linked List - Linked List Coding Interview Question

Find All Duplicates in an Array Algorithm Explained(LeetCode 442) | Amazon Coding Interview Question

Sorting Algorithm -- Merge Sort Algorithm -- Live Coding Session

394. Decode String | Decode String LeetCode | LeetCode 394 | Stacks

L2. Permutations of a String [Duplicate + Non-Duplicate] -- Backtracking + Recursion

Climbing Stairs (Fibonacci Series) || LeetCode 70 || Google Coding Interview Question

Decode Ways - Top Down Dynamic Programming - Ways to Decode - DP

Hamming Distance || LeetCode 461 || Bit Manipulation

L745. Prefix and Suffix Search || Trie || Prefix Tree

Facebook Interview Question: Common Element of Two Sorted Arrays

Swap Nodes in Pairs Recursively | Linked List | LeetCode 24

Bit Masking Explained with Examples (How to Set a Bit, How to Get a Bit)