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

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)

Preorder, Inorder, Post Order Traversal of a Binary Tree

Jump Game LeetCode || LeetCode 55 || Google Coding Interview Question

LeetCode 239. Sliding Window Maximum | Sliding Window Maximum LeetCode | Deque Solution | O(n)

LeetCode 10. Regular Expression Matching | Regular Expression Matching LeetCode |Dynamic Programming

Regular Expression Matching || Bottom Up Dynamic Programming

Palindrome Linked List || LeetCode 234 || Google Software Engineering Interview Question

Implementation of two stack using one array

Majority Element Hashmap Solution || LeetCode 169 || Google Software Engineering Interview Question

Majority Element LeetCode Explained | LeetCode 169 | Google Software Engineering Interview Question

Decode String | LeetCode 394. Decode String | Stack

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

L3. Permutations of an Array of Unique Element -- Permutations LeetCode -- Backtracking + Recursion

Design LRU Cache Data Sturcture | LeetCode 146. LRU Cache | Least Recently Used Cache (LRU Cache)

LeetCode 108. Convert Sorted Array to Binary Search Tree

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