Maqsad nhi bholna hai🫡
.
Prepare for Interviews like a PRO with Aryan🔥

LLD Crash Course for Freshers, SDE-I, SDE-II, SSE-I, SSE-II | Complete Guide
15:52
LLD Crash Course for Freshers, SDE-I, SDE-II, SSE-I, SSE-II | Complete Guide
2503. Maximum Number of Points From Grid Queries | Heap+BFS
34:12
2503. Maximum Number of Points From Grid Queries | Heap+BFS
2780. Minimum Index of a Valid Split | Boyer-Moore Majority Voting Algorithm
19:41
2780. Minimum Index of a Valid Split | Boyer-Moore Majority Voting Algorithm
1976. Number of Ways to Arrive at Destination | Dijkstras Algorithm
25:21
1976. Number of Ways to Arrive at Destination | Dijkstras Algorithm
2685. Count the Number of Complete Components | DFS | Graph
17:34
2685. Count the Number of Complete Components | DFS | Graph
2115. Find All Possible Recipes from Given Supplies | Topological Sort
11:53
2115. Find All Possible Recipes from Given Supplies | Topological Sort
2560. House Robber IV | Binary Search on Answer
16:27
2560. House Robber IV | Binary Search on Answer
2226. Maximum Candies Allocated to K Children | Binary Search 2nd Template
19:53
2226. Maximum Candies Allocated to K Children | Binary Search 2nd Template
3356. Zero Array Transformation II | Diff Array | Binary Search | Two Pointers | 2 Approaches
31:25
3356. Zero Array Transformation II | Diff Array | Binary Search | Two Pointers | 2 Approaches
1358. Number of Substrings Containing All Three Characters | Two Pointers
9:20
1358. Number of Substrings Containing All Three Characters | Two Pointers
3306. Count of Substrings Containing Every Vowel and K Consonants II | Two Pointers (Excatly K)
19:00
3306. Count of Substrings Containing Every Vowel and K Consonants II | Two Pointers (Excatly K)
3477 & 3479. Fruits Into Baskets III & II | Segment Tree
28:00
3477 & 3479. Fruits Into Baskets III & II | Segment Tree
3478. Choose K Elements With Maximum Sum | Sorting | Priority Queue
19:08
3478. Choose K Elements With Maximum Sum | Sorting | Priority Queue
2379. Minimum Recolors to Get K Consecutive Black Blocks | Sliding Window
12:49
2379. Minimum Recolors to Get K Consecutive Black Blocks | Sliding Window
2523. Closest Prime Numbers in Range | Sieve | Prime Numbers | 2 Approaches
14:52
2523. Closest Prime Numbers in Range | Sieve | Prime Numbers | 2 Approaches
2161. Partition Array According to Given Pivot | Arrays | Two Pointers
13:47
2161. Partition Array According to Given Pivot | Arrays | Two Pointers
3473. Sum of K Subarrays With Length at Least M | Top-Down | Bottom Up DP | Bottom Up Optimised
29:26
3473. Sum of K Subarrays With Length at Least M | Top-Down | Bottom Up DP | Bottom Up Optimised
3472. Longest Palindromic Subsequence After at Most K Operations | DP | Cyclic Behaviour
18:52
3472. Longest Palindromic Subsequence After at Most K Operations | DP | Cyclic Behaviour
3469. Find Minimum Cost to Remove Array Elements | DP (Memoization)
16:18
3469. Find Minimum Cost to Remove Array Elements | DP (Memoization)
3468. Find the Number of Copy Arrays | Array | Math
9:47
3468. Find the Number of Copy Arrays | Array | Math
2460. Apply Operations to an Array | Arrays | 2 Approaches
11:19
2460. Apply Operations to an Array | Arrays | 2 Approaches
1092. Shortest Common Supersequence | Recursion - Greedy - Memo - Bottom Up
15:41
1092. Shortest Common Supersequence | Recursion - Greedy - Memo - Bottom Up
873. Length of Longest Fibonacci Subsequence | DP & Two Pointers | 2 Approaches
19:18
873. Length of Longest Fibonacci Subsequence | DP & Two Pointers | 2 Approaches
1749. Maximum Absolute Sum of Any Subarray | Prefix Sums | 2 Approaches
19:36
1749. Maximum Absolute Sum of Any Subarray | Prefix Sums | 2 Approaches
1524. Number of Sub-arrays With Odd Sum | Prefix Sums | Arrays
13:54
1524. Number of Sub-arrays With Odd Sum | Prefix Sums | Arrays
2467. Most Profitable Path in a Tree | DFS | + Single DFS | Tree
32:06
2467. Most Profitable Path in a Tree | DFS | + Single DFS | Tree
3463 & 3461 Check If Digits Are Equal in String After Operations II | nCr | Luca's Theorem | Pascals
42:11
3463 & 3461 Check If Digits Are Equal in String After Operations II | nCr | Luca's Theorem | Pascals
3462. Maximum Sum With at Most K Elements | Greedy
10:00
3462. Maximum Sum With at Most K Elements | Greedy
889. Construct Binary Tree from Preorder and Postorder Traversal | Standard Approaches
20:50
889. Construct Binary Tree from Preorder and Postorder Traversal | Standard Approaches
1028. Recover a Tree From Preorder Traversal | Stack | Binary Tree
18:27
1028. Recover a Tree From Preorder Traversal | Stack | Binary Tree