View
Tube
search
Sign in
Sign up
Subscriptions
Aryan Mittal
Faang Interview Questions & Solutions by Aryan
2,246 views
309 items
Last updated on Apr 29, 2024
public playlist
Aryan Mittal
37:14
1915. Number of Wonderful Substrings | Bit Manipulation | Bit Masking | XOR | De-shaw
Aryan Mittal
17:29
3132 & 3131 Find the Integer Added to Array II | 3131. Find the Integer Added to Array I
Aryan Mittal
19:11
3133. Minimum Array End | Bit Interweaving | Bit Interleaving | Bit Manipulation | 2 Pointers
Aryan Mittal
32:11
834. Sum of Distances in Tree | Tree | DP on Trees | Exploit your Parents💀
Aryan Mittal
12:44
3128. Right Triangles | Math | Array | Biweekly Contest 129
Aryan Mittal
58:17
3130 & 3129 Find All Possible Stable Binary Arrays II | DP | Prefix Sums | Sliding Window
Aryan Mittal
48:12
514. Freedom Trail | DP | Dijkstras | Google | Top-Down | Bottom-Up | Bottom-Up Optimized
Aryan Mittal
40:09
1289. Minimum Falling Path Sum II | DP | Greedy | Apple | Google | 5 Ways
Aryan Mittal
27:53
2370. Longest Ideal Subsequence | 0/1 knapsack | DP | Top Down | Bottom Up
Aryan Mittal
25:09
310. Minimum Height Trees | BFS | Topological Sort | Graphs
Aryan Mittal
25:58
752. Open the Lock | BFS | Graph | Time Complexity | Why not DP?
Aryan Mittal
10:05
3100. Water Bottles II | Simulation | Array | Weekly Contest 391
Aryan Mittal
8:22
3101. Count Alternating Subarrays | Easy | Array | Hash Map
Aryan Mittal
26:33
3102. Minimize Manhattan Distances | Max Manhattan Distance between Any Points | Math
Aryan Mittal
37:10
3098. Find the Sum of Subsequence Powers | 4D DP | time- O(n^5) [*will be updated for O(n^4)]
Aryan Mittal
7:42
3096. Minimum Levels to Gain More Points | Prefix Sums | Arrays
Aryan Mittal
28:58
3097. Shortest Subarray With OR at Least K II | Sliding Window | 2 Pointers | Bit Manipulation
Aryan Mittal
17:46
2962. Count Subarrays Where Max Element Appears at Least K Times | 2 Pointer | Sliding Window
Aryan Mittal
10:25
2958. Length of Longest Subarray With at Most K Frequency | 2 Pointers | Sliding Window
Aryan Mittal
42:52
41. First Missing Positive | Cycle Sort | Using Array as Hash | HashMap | 5 Approaches
Aryan Mittal
33:42
143. Reorder List | 234. Palindrome Linked List | 876. Middle of the Linked List | 206. Reverse LL
Aryan Mittal
26:38
206. Reverse Linked List | Iterative & Recursive | Super Important for Interviews 📝
Aryan Mittal
9:31
1669. Merge In Between Linked Lists | Merge Linked List | Vmware | Google | Sambanova
Aryan Mittal
16:37
452. Minimum Number of Arrows to Burst Balloons | Delete overlapping intervals
Aryan Mittal
16:14
3085. Minimum Deletions to Make String K-Special | DP | Hash Table
Aryan Mittal
5:57
3084. Count Substrings Starting and Ending with Given Character | Math | Sum of n Natural Numbers
Aryan Mittal
16:22
3080. Mark Elements on Array by Performing Queries | Set | Min Heap | Priority Queue
Aryan Mittal
27:47
57. Insert Interval | 56. Merge Intervals | 2 Approaches | FAANG Favourite ❤️
Aryan Mittal
30:04
3081. Replace Question Marks in String to Minimize Its Value | Priority Queue | Min Heap | Multiset
Aryan Mittal
36:13
3082. Find the Sum of the Power of All Subsequences | 0-1 knapsack DP | Binary Exponentiation
Aryan Mittal
18:45
525. Contiguous Array | Prefix Sums | Hash Tables | 3 Approaches
Aryan Mittal
24:37
238. Product of Array Except Self | Math | Prefix Product | 4 Approaches
Aryan Mittal
37:07
930. Binary Subarrays With Sum | 560. Subarray Sum Equals K | Prefix Sums | 2 Pointer Crash Course
Aryan Mittal
20:45
2485. Find the Pivot Integer | 3 Ways | 2 Pointer | Math | Brute-to-Optimal
Aryan Mittal
35:26
1171. Remove Zero Sum Consecutive Nodes from Linked List | Prefix Sum | Brute -to- Optimal
Aryan Mittal
11:25
791. Custom Sort String | 2 Approaches | Custom Comparator | Hash Map | Meta
Aryan Mittal
25:13
3076. Shortest Uncommon Substring in an Array | Implementation | Time Complexity Analysis
Aryan Mittal
58:09
3077. Maximum Strength of K Disjoint Subarrays | Math | Hard DP | Weekly Contest 388
Aryan Mittal
12:41
349. Intersection of Two Arrays | 4 Approaches | Sorting | 2 Pointer | Hash Set | Binary Search
Aryan Mittal
9:54
2540. Minimum Common Value | 3 Approaches | HashMap | 2 Pointers | Binary Search
Aryan Mittal
16:51
1750. Minimum Length of String After Deleting Similar Ends | 2 Pointers | Edge Cases
Aryan Mittal
15:34
948. Bag of Tokens | Greedy | 2 Pointers | Bloomberg | Apple | Complete Intuition
Aryan Mittal
13:37
3070. Count Submatrices with Top-Left Element and Sum Less Than k | Prefix Sum
Aryan Mittal
12:14
3071. Minimum Operations to Write the Letter Y on a Grid | Arrays | Matrix
Aryan Mittal
14:51
2864. Maximum Odd Binary Number | Sorting | Math | Bit Manipulation | 2 Pointer | 3 Ways
Aryan Mittal
12:40
1609. Even Odd Tree | Tree | BFS | Complete Intuition
Aryan Mittal
8:59
513. Find Bottom Left Tree Value | Tree | DFS | BFS | Basics of Graph or Tree Traversals
Aryan Mittal
22:15
543. Diameter of Binary Tree | 3 Ways | Tree | ⭐️IMPORTANT⭐️ | Facebook
Aryan Mittal
10:10
100. Same Tree | Tree | DFS | Recursion | Understanding Time & Space Complexity
Aryan Mittal
16:57
3047. Find the Largest Area of Square Inside Two Rectangles | Math | Geometry | Weekly Contest 386
Aryan Mittal
38:32
3048. Earliest Second to Mark Indices I | Binary Search | Greedy | Weekly Contest 386
Aryan Mittal
33:33
2709. Greatest Common Divisor Traversal | Prime Number | Prime Factors | Graph | DFS | DSU
Aryan Mittal
36:01
787. Cheapest Flights Within K Stops | Dijkstras | BFS | Complete Internal Working
Aryan Mittal
42:49
3045. Count Prefix and Suffix Pairs I & II | Trie | Hashing | Complete Intuition
Aryan Mittal
11:45
231. Power of Two | Bit Manipulation | Remove Last Set Bit | Adobe | Apple | Google
Aryan Mittal
39:38
2402. Meeting Rooms III | Sorting | Heap(Priority Queue) | Hard 🥶
Aryan Mittal
8:59
3039. Apply Operations to Make String Empty | String | Hash Table | Observation Questions🧐
Aryan Mittal
17:41
3040. Maximum Number of Operations With the Same Score II | Standard DP✅
Aryan Mittal
13:59
3041. Maximize Consecutive Elements in an Array After Modification | DP | Hard ❌ - Easy ✅
Aryan Mittal
27:32
1642. Furthest Building You Can Reach | 5 ways | Why not DP | Min Heap | Binary Search | Greedy
Aryan Mittal
28:48
1481. Least Number of Unique Integers after K Removals | Hash Map | Counting Sort
Aryan Mittal
16:42
2971. Find Polygon With the Largest Perimeter | Greedy | Prefix Sums
Aryan Mittal
29:53
169. Majority Element | HashMap| Sorting | BitManipulation | Boyer-Moore Voting Algorithm | 5 Ways
Aryan Mittal
18:34
3035. Maximum Palindromes After Operations | Greedy | Palindrome | String | Sorting
Aryan Mittal
18:36
3036. Number of Subarrays That Match a Pattern II | KMP | String Matching
Aryan Mittal
25:06
1463. Cherry Pickup II | 4D DP | 3D DP | Dynamic Programming | Flipkart | Google
Aryan Mittal
36:33
647. Palindromic Substrings | Brute | DP | 2 Pointers | Top Down DP | Bottom Up DP | O(n) Hints
Aryan Mittal
31:18
368. Largest Divisible Subset | DP | Longest Increasing Subsequence | LIS
Aryan Mittal
30:12
279. Perfect Squares | 5 Ways | DP | Math | BFS | Lagrange & Legendre Theorem | Top-Down | Bottom Up
Aryan Mittal
13:51
49. Group Anagrams | string | Hash Table | Hot Interview Question 🔥
Aryan Mittal
3:58
3028. Ant on the Boundary | Arrays | Weekly Contest 383
Aryan Mittal
26:21
3030. Find the Grid of Region Average | Array | Matrix | Weekly Contest 383
Aryan Mittal
41:51
3031. Minimum Time to Revert Word to Initial State II | KMP | Weekly Contest 383 | String Matching
Aryan Mittal
39:20
76. Minimum Window Substring | 5 Improvizations | Sliding Window
Aryan Mittal
7:29
3024. Type of Triangle II | Math | Array | Biweekly Contest 123
Aryan Mittal
25:33
3026. Maximum Good Subarray Sum | Prefix Sums | Hash Table | Biweekly Contest 123
Aryan Mittal
36:39
3027. Find the Number of Ways to Place People II | Sorting | Geometry | Biweekly Contest 123
Aryan Mittal
25:47
1043. Partition Array for Maximum Sum | DP | Recursion - Top Down - Bottom Up - Bottom Up Optimised
Aryan Mittal
55:31
Meet in the Middle | 2035. Partition Array Into Two Arrays to Minimize Sum Difference | Day 022
Aryan Mittal
9:37
1291. Sequential Digits | Sliding Window | Not a Digit DP | Time & Space - O(1)
Aryan Mittal
9:46
2966. Divide Array Into Arrays With Max Difference | Google | Greedy
Aryan Mittal
28:34
739. Daily Temperatures | Monotonic Stack | Space Optimisation O(1) | Hot Interview Question 🔥
Aryan Mittal
16:47
150. Evaluate Reverse Polish Notation | Stack | Hot Interview Question 🔥
Aryan Mittal
8:45
2. Add Two Numbers | Day 021 | Linked List | Hottest Question in Linked List
Aryan Mittal
13:39
232. Implement Queue using Stacks | Stack & Queue | Amazon | Goldman Sachs | Apple
Aryan Mittal
18:08
3020. Find the Maximum Number of Elements in Subset | Why Map & not Unordered Map
Aryan Mittal
20:48
3021. Alice and Bob Playing Flower Game | Fancy Math++ | Easy Game Theory
Aryan Mittal
50:24
1074. Number of Submatrices That Sum to Target | Prefix Sums | Brute - Better - Optimal
Aryan Mittal
14:13
21. Merge Two Sorted Lists | Day 020 | Linked List | How to approach in an Interview
Aryan Mittal
45:50
629. K Inverse Pairs Array | DP + Sliding Window | Recursion to Bottom Up Optimised ++
Aryan Mittal
1:23:11
3017. Count the Number of Houses at a Certain Distance II | Prefix Sum | Hard++
Aryan Mittal
38:53
576. Out of Boundary Paths | Recursion - Memoization - Bottom Up - Bottom Up Optimised
Aryan Mittal
25:17
1143. Longest Common Subsequence | Recursion - Greedy - Memo - Bottom Up - Bottom Up Optimised
Aryan Mittal
13:17
1492. The kth Factor of n | Day 019 | Math | Number Theory | Factors | Divisors
Aryan Mittal
29:10
1457. Pseudo-Palindromic Paths in a Binary Tree | Tree | Xor | Count set bits | Bit Manipulation
Aryan Mittal
52:57
1239. Maximum Length of Concatenated String with Unique | Recursion | Bactracking | Bit Manipulation
Aryan Mittal
46:31
139. Word Break | Day 018 | Recursion | Top Down DP | Bottom Up DP | Trie
Aryan Mittal
9:48
3016. Minimum Number of Pushes to Type Word II | Greedy | Word I
Aryan Mittal
10:20
3015. Count the Number of Houses at a Certain Distance I | Floyd Warshall
Aryan Mittal
33:09
3013. Divide an Array Into Subarrays With Minimum Cost II | Sliding Window | Multisets
![3098. Find the Sum of Subsequence Powers | 4D DP | time- O(n^5) [*will be updated for O(n^4)]](/api/proxy/image?url=https://i.ytimg.com/vi/3go6vNha0Do/sddefault.jpg&local=true)
