Sort by

Newest

Oldest

Popular

Singleton Design Pattern | In Depth Complete Explanation
00:59:49
Candy | LC 135 | Hard | In Depth Explanation
00:44:07
Heaps Implementation || Priority Queue | From Scratch
01:01:31
Unique Path 2 | DP | Backtracking | O(N * M) | Detailed Explanation
00:22:28
Unique Paths | DP | Backtracking | O(N) | Detailed Explanation
00:31:20
House Robber | DP Series | O(N)
00:32:17
Climbing Stairs | DP Series | Backtracking
00:22:02
LeetCode | 64. Minimum Path Sum | DP | Backtracking | O(N * M) | Very Detailed Explanation
00:45:51
Leetcode | Count All Primes | A very very Detailed Explanation
00:51:33
Leetcode | Online Stock Span | Optimal Approach
00:33:03
Leetcode | 132 Pattern | Stack
00:35:34
Leetcode | 102  Binary Tree Level Order Traversal | BFS
00:09:05
Leetcode | 572  Subtree of Another Tree | DFS | Stack Trace
00:25:35
Leetcode | 543  Diameter of Binary Tree | DFS | Postorder Traversal
00:10:26
Leetcode |  104  Maximum Depth of Binary Tree | ON | Recursion | DFS
00:22:08
Leetcode | 236 Lowest Common Ancestor of a Binary Tree | O(N) | DFS
00:25:21
Leetcode | Inorder Traversal| Without Recursion | Iterative Method
00:22:41
Leetcode | 145  Binary Tree Postorder Traversal | DFS | Stack Trace | Recursion
00:21:47
Leetcode | 94. Binary Tree Inorder Traversal | Stack Trace | Recursion
00:18:46
Leetcode | 144. Binary Tree Preorder Traversal | Recursion | Stack Trace
00:32:39
Leetcode | 50. Pow(x, n) | Recursion | Fast Power Algorithm | O(LogN)
00:28:27
Leetcode | 2593. Find Score of an Array After Marking All Elements | O(NlogN)
00:34:09
Leetcode 875 | Koko Eating Bananas | Binary Search
00:16:49
Leetcode | 3152. Special Array II | PrefixSum | O(N)
00:25:19
Leetcode | 1760. Minimum Limit of Balls in a Bag | Binary Search | POTD | In depth Explanation.
00:54:23
Leetcode | 1011. Capacity To Ship Packages Within D Days | Binary Search | O(NLogN) | Very Intuitive
00:39:44
Leetcode 2554 | Maximum Number of Integers to Choose From a Range I | O(N) | PTOD
00:23:50
Leetcode 2337 | Move Pieces to Obtain a String | Two Pointers | O(N)
00:30:23
Leetcode | 74 Search a 2D Matrix | O(logN) | O(N + M)
00:37:35
Leetcode | 540. Single Element in a Sorted Array | BS | O(logN)
00:32:54