Channel Avatar

Aryan Mittal @UC4lyxGubhu5u1s1LYCwXtZw@youtube.com

46K subscribers - no pronouns :c

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


04:51
3227. Vowels Game in a String | Greedy | Strings
10:46
3228. Maximum Number of Operations to Move Ones to the End | Greedy | Two Pointers
24:51
3229. Minimum Operations to Make Array Equal to Target | Greedy | With Proof
16:46
2392. Build a Matrix With Conditions | Topological Sort | Graph | Easy & Clean Code
05:51
3223. Minimum Length of String After Operations | Hash Map | Strings
37:15
3224. Minimum Array Changes to Make Differences Equal | Prefix Sums | Why not Greedy
12:05
1605. Find Valid Matrix Given Row and Column Sums | Greedy | With Proof
22:15
1380. Lucky Numbers in a Matrix | 4 Approaches | Brute - Better - Optimal - Optimal++ | Arrays
22:35
1530. Number of Good Leaf Nodes Pairs | LCA | BFS | DFS | 4 Approaches
12:33
1110. Delete Nodes And Return Forest | DFS | Tree | Google's Favourite
15:13
2096. Step-By-Step Directions From a Binary Tree Node to Another | LCA | Backtracking | 2 Pointers
16:37
236. Lowest Common Ancestor of a Binary Tree | [Super Important] | LCA of Binary Tree
07:32
2196. Create Binary Tree From Descriptions | Tree | Hash Map @codeWithAryanBhai
14:05
3218 & 3219. Minimum Cost for Cutting Cake II & I | Greedy | Sorting @codeWithAryanBhai
32:05
726. Number of Atoms | Stack | Pre-processing | O(nlogn) time | 2 Approaches @codeWithAryanBhai
19:30
2751. Robot Collisions | Stack | Sorting | Not Hard 🫡
29:44
1717. Maximum Score From Removing Substrings | Why not DP | Greedy | Stack | 2 Pointer | 2 Approach
20:00
1190. Reverse Substrings Between Each Pair of Parentheses | StacK | Wormhole Teleportation technique
35:28
3213. Construct String with Minimum Cost | DP + Trie | ! Aho-Corasick Algorithm Explanation
06:15
1598. Crawler Log Folder | Stack | Array | O(1) Space
13:21
1701. Average Waiting Time | Simulation | Array
17:37
1823. Find the Winner of the Circular Game | Queue | Recursion | Math | 3 Approaches
14:54
1518. Water Bottles | O(1) time | Math | 2 Approaches
12:15
3207. Maximum Points After Enemy Battles | Sorting | Greedy
16:32
3206 & 3208. Alternating Groups II | 3206. Alternating Groups I | Not Sliding Window
22:05
3209. Number of Subarrays With AND Value of K | Bit Manipulation | Arrays | Hash Map
18:07
2058. Find the Minimum and Maximum Number of Nodes Between Critical Points | Greedy | Linked List
15:11
2181. Merge Nodes in Between Zeros | Linked List | How to Write Linked List Code
14:30
1509. Minimum Difference Between Largest and Smallest Value in Three Moves | Heap | Sorting | Greedy
37:26
3201, 3202. Find the Maximum Length of Valid Subsequence II | | Math | DP | LIS Similar
23:43
3203. Find Minimum Diameter After Merging Two Trees | Diameter of a Tree | Graph
23:19
2192. All Ancestors of a Node in a Directed Acyclic Graph | Topological Sort | Merge Two Sorted List
11:34
2285. Maximum Total Importance of Roads | Greedy | Indegree OutDegree | Graph
06:02
1791. Find Center of Star Graph | Indegree - Outdegree | Microsoft
34:49
1382, 108 Balance a Binary Search Tree | Day-Stout-Warren (DSW) Algorithm | In-Place Balancing
34:27
1038. Binary Search Tree to Greater Sum Tree | Recursive | Iterative | Morris Traversal
35:03
995, 3191, 3192 Minimum Number of K Consecutive Bit Flips | Bit Manipulation | Sliding Wind | Greedy
21:04
3196. Maximize Total Cost of Alternating Subarrays | DP | 0/1 Knapsack
43:44
1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | 3 Approaches
56:26
3193. Count the Number of Inversions | DP Time Complexity | Two Pointer | DP Space Optimized
09:42
1248. Count Number of Nice Subarrays | Prefix Sums | Sliding Window | Same as Leetcode 930
12:49
1052. Grumpy Bookstore Owner | Sliding Window | Walmart Labs | EPAM Systems
15:13
1552. Magnetic Force Between Two Balls | Binary Search on Answer | Greedy
17:55
1482. Minimum Number of Days to Make m Bouquets | Binary Search | Problem Statement 🤡 Problem 🗿
26:18
826. Most Profit Assigning Work | 5 Approaches | Greedy | Binary S | Priority Queue | 2 Pointer | DP
15:49
633. Sum of Square Numbers | Math | 2 Pointer | Binary Search | Two Sum
11:42
3185. & 3184 Count Pairs That Form a Complete Day II | Same as Two Sum | Modulo Operation
20:39
3186. Maximum Total Damage With Spell Casting | DP + Binary Search | Same as LIS
18:06
3187. Peaks in Array | Segment Tree | Range Sum | 2 Line Change in Template | Fenwick Tree
23:19
330. Patching Array | Greedy | Array | Math | Why not Bitset Trick
23:57
502. IPO | Greedy | Priority Queue | Sorting | Zeta | Salesforce | Amazon
19:49
945. Minimum Increment to Make Array Unique | Greedy | Counting Sort
12:40
2037. Minimum Number of Moves to Seat Everyone | Greedy | Counting Sort
20:21
75. Sort Colors | 2 Pointers | Super Important Interview Question | 100Days 100K Placements
09:06
1122. Relative Sort Array | Counting Sort Deep | Map | 2 Approaches | Amazon | Apple | De shaw
12:07
1051. Height Checker | All form of Sort Complexity | Counting Sort
09:30
3178. Find the Child Who Has the Ball After K Seconds | Math | Cyclic Math Pattern
07:51
3179. Find the N-th Value After K Seconds | Pascal's Triangle | DP | Bottom Up Optimised DP
51:22
3181 & 3180 | BitSet Crash Course | DP | 3181. Maximum Total Reward Using Operations II & I
17:19
974. Subarray Sums Divisible by K | PrefSum | Not an Easy Problem