View
Tube
search
Sign in
Sign up
Subscriptions
Aryan Mittal
Google Interview Questions by Aryan
2,718 views
150 items
Updated yesterday
public playlist
Aryan Mittal
8:26
409. Longest Palindrome | Hash Table | Greedy | Hot Interview Question
Aryan Mittal
21:59
1608. Special Array With X Elements Greater Than or Equal X | 3 Ways | Binary Search | Counting Sort
Aryan Mittal
22:43
552. Student Attendance Record II | Top-Down DP | Bottom Up Optimized DP
Aryan Mittal
22:54
131. Palindrome Partitioning | Recursion | Backtracking | 2 Approaches
Aryan Mittal
17:34
979. Distribute Coins in Binary Tree | Tricky DFS | Recursion
Aryan Mittal
10:16
2331. Evaluate Boolean Binary Tree | Full Binary Tree | Complete Tree | Perfect Tree | Balanced Tree
Aryan Mittal
28:55
2812. Find the Safest Path in a Grid | DFS + BFS | Binary Search | Multi BFS Traversal
Aryan Mittal
30:49
857. Minimum Cost to Hire K Workers | Priority Queue | Heap | Kinda Sliding Window
Aryan Mittal
50:36
786. K-th Smallest Prime Fraction | Priority Queue | Binary Search on Answer | 2 Pointers
Aryan Mittal
28:37
378. Kth Smallest Element in a Sorted Matrix | Priority Queue | Binary Search on Answer
Aryan Mittal
16:12
506. Relative Ranks | Sorting | Priority Queue | Multiset | Counting Sort
Aryan Mittal
7:43
237. Delete Node in a Linked List | Singly Linked List | Easy | Amazon | Microsoft
Aryan Mittal
37:14
1915. Number of Wonderful Substrings | Bit Manipulation | Bit Masking | XOR | De-shaw
Aryan Mittal
32:11
834. Sum of Distances in Tree | Tree | DP on Trees | Exploit your Parents💀
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
25:09
310. Minimum Height Trees | BFS | Topological Sort | Graphs
Aryan Mittal
13:46
1971. Find if Path Exists in Graph | DFS | Connected Components | DSU | Union Find
Aryan Mittal
13:03
463. Island Perimeter | No BFS or DFS | With DFS | With BFS
Aryan Mittal
24:25
988. Smallest String Starting From Leaf | Tree | DFS | Recursion & Backtracking | Divide & Conquer
Aryan Mittal
7:05
404. Sum of Left Leaves | Binary Tree | Tree | DFS
Aryan Mittal
1:10:03
85. Maximal Rectangle | 221. Maximal Square | 84. Largest Rectangle in Histogram | Monotonic Stack |
Aryan Mittal
25:17
402. Remove K Digits | Monotonic Stack | Greedy | Brute Force - Optimal Solution
Aryan Mittal
39:32
678. Valid Parenthesis String | DP | Stacks | 2 Pointers | 3 Ways
Aryan Mittal
39:27
1249. Minimum Remove to Make Valid Parentheses | Stack | 4 ways
Aryan Mittal
39:07
79. Word Search | Recursion & Backtracking | 489. Robot Room Cleaner | 2 Approaches
Aryan Mittal
15:41
205. Isomorphic Strings | Hash Map | Strings | Yandex | Adobe | Bloomberg | Google | Yahoo
Aryan Mittal
19:01
992. Subarrays with K Different Integers | Sliding Window | 2 Pointers | FAANG
Aryan Mittal
42:52
41. First Missing Positive | Cycle Sort | Using Array as Hash | HashMap | 5 Approaches
Aryan Mittal
21:18
442. Find All Duplicates in an Array | HashMap | 4 Approaches | O(1) Space - No modification
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
27:47
57. Insert Interval | 56. Merge Intervals | 2 Approaches | FAANG Favourite ❤️
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
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
12:41
349. Intersection of Two Arrays | 4 Approaches | Sorting | 2 Pointer | Hash Set | Binary Search
Aryan Mittal
30:02
315. Count of Smaller Numbers After Self | Day 024 | Fenwick Tree | Merge Sort
Aryan Mittal
15:34
948. Bag of Tokens | Greedy | 2 Pointers | Bloomberg | Apple | Complete Intuition
Aryan Mittal
14:55
19. Remove Nth Node From End of List | 2 Ways | Linked List | ⭐️Very Important Interview Problem⭐️
Aryan Mittal
12:15
977. Squares of a Sorted Array | when to use 2 Pointer | Sorting | 2 Ways
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
36:01
787. Cheapest Flights Within K Stops | Dijkstras | BFS | Complete Internal Working
Aryan Mittal
16:41
997. Find the Town Judge | 2 ways | Premium Problem | Graph | Array | HashMap
Aryan Mittal
17:37
201. Bitwise AND of Numbers Range | Remove Last Set Bit | Bit Manipulation
Aryan Mittal
12:56
268. Missing Number | HashMap | Bit Manipulation | Gauss Formula(Math) | 4 Ways
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
27:32
1642. Furthest Building You Can Reach | 5 ways | Why not DP | Min Heap | Binary Search | Greedy
Aryan Mittal
19:38
98. Validate Binary Search Tree | Day 023 | 2 Ways | Limit Ranges | Inorder Traversal
Aryan Mittal
29:53
169. Majority Element | HashMap| Sorting | BitManipulation | Boyer-Moore Voting Algorithm | 5 Ways
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
24:36
451. Sort Characters By Frequency | 3 Ways | Sorting | Hash Table | Bucket Sort | Adobe | Apple
Aryan Mittal
13:51
49. Group Anagrams | string | Hash Table | Hot Interview Question 🔥
Aryan Mittal
39:20
76. Minimum Window Substring | 5 Improvizations | Sliding Window
Aryan Mittal
55:31
Meet in the Middle | 2035. Partition Array Into Two Arrays to Minimize Sum Difference | Day 022
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
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
25:17
1143. Longest Common Subsequence | Recursion - Greedy - Memo - Bottom Up - Bottom Up Optimised
Aryan Mittal
46:31
139. Word Break | Day 018 | Recursion | Top Down DP | Bottom Up DP | Trie
Aryan Mittal
33:09
3013. Divide an Array Into Subarrays With Minimum Cost II | Sliding Window | Multisets
Aryan Mittal
12:11
198. House Robber | Recursion - Top Down - Bottom Up - Bottom Up Optimised
Aryan Mittal
29:26
22. Generate Parentheses | Day 017 | Recursion - Improvised Recursion - Backtracking
Aryan Mittal
21:27
146. LRU Cache | Day 016 | 2 Ways | Doubly Linked List | In Build Libraries | Hot Interview Ques🔥
Aryan Mittal
14:00
316. Remove Duplicate Letters | Day 015 | Stack | Hot Interview Question🔥
Aryan Mittal
11:32
1207. Unique Number of Occurrences | Two Ways | Apple | Amazon | Google | Facebook | TCS
Aryan Mittal
30:25
215. Kth Largest Element in an Array | Day 014 | 3 Ways | Quick Select | Min Heap | Sorting
Aryan Mittal
18:54
380. Insert Delete GetRandom O(1) | Hot & Important Question For Interviews | FAANG++
Aryan Mittal
40:42
287. Find the Duplicate Number | Day 013 | 5 Ways | Binary Search | Bit Manipulation | Slow & Fast
Aryan Mittal
11:28
1657. Determine if Two Strings Are Close | Arrays | Cases | Meta | Google
Aryan Mittal
18:14
3. Longest Substring Without Repeating Characters | Day 012 | Sliding Window | 2 Pointer
Aryan Mittal
10:31
1026. Maximum Difference Between Node and Ancestor | Amazon | Google | Meta
Aryan Mittal
36:44
4. Median of Two Sorted Arrays | Day 009 | 2Pointer | Binary Search | Torture Question :)
Aryan Mittal
8:33
938. Range Sum of BST | Short & Simple | Meta | Google | Facebook
Aryan Mittal
24:56
486. Predict the Winner | Day 004 | Game Theory | Recursion | Top-Down | Bottom Up Optimised DP
Aryan Mittal
18:02
1235. Maximum Profit in Job Scheduling | DP | Binary Search | All Companies
Aryan Mittal
17:30
1155. Number of Dice Rolls With Target Sum | 2D DP | Amazon | Apple | Google
Aryan Mittal
28:33
91. Decode Ways | 3 Ways | Salesforce | Uber | Oracle | Commvault | 3 Ways
Aryan Mittal
14:55
1422. Maximum Score After Splitting a String | Google | 4 ways | One Pass
Aryan Mittal
31:01
661. Image Smoother | Bit Manipulation | Amazon | Microsoft | Facebook
Aryan Mittal
15:11
1582. Special Positions in a Binary Matrix | Important Matrix Trick | Google | Bloomberg
Aryan Mittal
18:55
1287. Element Appearing More Than 25% In Sorted Array | Binary Search | Google | 3 Ways
Aryan Mittal
28:09
94. Binary Tree Inorder Traversal | Morris Traversal | Space - O(1) | Amazon | Adobe | Uber | Meta
Aryan Mittal
14:39
1716. Calculate Money in Leetcode Bank | Time - O(1) | Math | Arithmetic Progression
Aryan Mittal
19:59
2147. Number of Ways to Divide a Long Corridor | Combinatorics | Math | Space - O(1) | Google
Aryan Mittal
27:50
935. Knight Dialer | 3 Ways | O(1) space | Facebook | Bloomberg | Google
Aryan Mittal
32:19
1727. Largest Submatrix With Rearrangements | 3 Ways | O(m*n) time | Google
