Minimum Cost to Hire K Workers - Leetcode 857 - Java - Explanation + Solution - MaxHeap -Hard
14:48
Minimum Cost to Hire K Workers - Leetcode 857 - Java - Explanation + Solution - MaxHeap -Hard
K-th Smallest Prime Fraction - Leetcode 786 || Explanation + Solution || Meta Interview Question
14:21
K-th Smallest Prime Fraction - Leetcode 786 || Explanation + Solution || Meta Interview Question
Maximize Happiness of Selected Children -Leetcode 2075 || Details Explanation + Soln || AMAZON
8:05
Maximize Happiness of Selected Children -Leetcode 2075 || Details Explanation + Soln || AMAZON
Relative Ranks -Leetcode 506 || PriorityQueue(Maxheap)|| Details Explanation + Soln.|| Leetcode Easy
10:12
Relative Ranks -Leetcode 506 || PriorityQueue(Maxheap)|| Details Explanation + Soln.|| Leetcode Easy
Delete Node in a Linked List - Leetcode 237 || Beginner Friendly Explanation || O(1) Complexity
6:04
Delete Node in a Linked List - Leetcode 237 || Beginner Friendly Explanation || O(1) Complexity
Boats to Save People -Leetcode881 || Details Explanation + Soln. ||MICROSOFT AMAZON GOOGLE INTERVIEW
7:23
Boats to Save People -Leetcode881 || Details Explanation + Soln. ||MICROSOFT AMAZON GOOGLE INTERVIEW
Compare Version Numbers - Leetcode 165 || Details Solution || AMAZON MICROSOFT GOOGLE INTERVIEW
15:11
Compare Version Numbers - Leetcode 165 || Details Solution || AMAZON MICROSOFT GOOGLE INTERVIEW
Largest Positive Integer That Exists With Its Negative - Leetcode 2441 || 3 Approach || Microsoft
13:46
Largest Positive Integer That Exists With Its Negative - Leetcode 2441 || 3 Approach || Microsoft
Reverse Prefix of Word -Leetcode 2000 || Detailed Solution || EASY || AMAZON GOOGLE INTERVIEW
6:58
Reverse Prefix of Word -Leetcode 2000 || Detailed Solution || EASY || AMAZON GOOGLE INTERVIEW
Minimum Number of Operations to Make Array XOR Equal to K -Leetcode 2997|| Medium|| Bit Manipulation
9:41
Minimum Number of Operations to Make Array XOR Equal to K -Leetcode 2997|| Medium|| Bit Manipulation
Sum of Distances in Tree (Google) : Explanation - Leetcode 834 || Tree || Pre + Post Order Traversal
16:35
Sum of Distances in Tree (Google) : Explanation - Leetcode 834 || Tree || Pre + Post Order Traversal
Freedom Trail - Leetcode 514 || Dynamic Programming || Hard || Why Recursion fails?
13:01
Freedom Trail - Leetcode 514 || Dynamic Programming || Hard || Why Recursion fails?
Longest Ideal Subsequence - Leetcode 2370 || Why Not Greedy ? || String || Dynamic Programming
20:48
Longest Ideal Subsequence - Leetcode 2370 || Why Not Greedy ? || String || Dynamic Programming
N-th Tribonacci Number - Leetcode 1137 || Math || Observation || Easy
9:04
N-th Tribonacci Number - Leetcode 1137 || Math || Observation || Easy
Find if Path Exists in Graph - Leetcode 1971|| DFS || Graph || visited node || matrix
12:35
Find if Path Exists in Graph - Leetcode 1971|| DFS || Graph || visited node || matrix
Number of Islands - Leetcode 200 || Leetcode Medium || DFS || BFS || Queue || Graph || Matrix
19:23
Number of Islands - Leetcode 200 || Leetcode Medium || DFS || BFS || Queue || Graph || Matrix
Island Perimeter - Leetcode 462 || Matrix || Beginner Friendly Explanation
13:31
Island Perimeter - Leetcode 462 || Matrix || Beginner Friendly Explanation
Smallest String Starting From Leaf- Leetcode 988 || Leetcode Medium || DFS || Tree Traversal
11:22
Smallest String Starting From Leaf- Leetcode 988 || Leetcode Medium || DFS || Tree Traversal
Add One Row to Tree - Leetcode 623 || Leetcode Medium || DFS || BFS || Queue || Tree Traversal
12:59
Add One Row to Tree - Leetcode 623 || Leetcode Medium || DFS || BFS || Queue || Tree Traversal
Sum Root to Leaf Numbers - Leetcode 129 || Leetcode medium || DFS || Tree Traversal || cpp
12:27
Sum Root to Leaf Numbers - Leetcode 129 || Leetcode medium || DFS || Tree Traversal || cpp
Sum of Left Leaves - Leetcode 404 || Leetcode Easy || BFS || DFS || Tree Traversal
13:18
Sum of Left Leaves - Leetcode 404 || Leetcode Easy || BFS || DFS || Tree Traversal
Remove K Digits - Leetcode 420 || String || Monotonic Stack || Greedy
17:36
Remove K Digits - Leetcode 420 || String || Monotonic Stack || Greedy
Reveal Cards in increasing order - Leetcode 950 || Deque || Simulation || Intuition + Explanation
27:37
Reveal Cards in increasing order - Leetcode 950 || Deque || Simulation || Intuition + Explanation
Time Needed to Buy Tickets - Leetcode 2073 || Leetcode Easy
8:40
Time Needed to Buy Tickets - Leetcode 2073 || Leetcode Easy
Number of Students Unable to Eat Lunch Leetcode 1700 || Stack || Queue || Brute force to Optimal
16:23
Number of Students Unable to Eat Lunch Leetcode 1700 || Stack || Queue || Brute force to Optimal
Maximum Nesting Depth of the Parentheses - Leetcode 1614 || Easy || String || Stack
12:35
Maximum Nesting Depth of the Parentheses - Leetcode 1614 || Easy || String || Stack
Word Search - Leetcode 79 || Leetcode Medium || String || Matrix || DFS || Backtracking
13:11
Word Search - Leetcode 79 || Leetcode Medium || String || Matrix || DFS || Backtracking
Isomorphic Strings - Leetcode 205 || String || Hash Table || cpp || ✅✅🔥🔥
11:01
Isomorphic Strings - Leetcode 205 || String || Hash Table || cpp || ✅✅🔥🔥
Length of Last Word - Leetcode 58 || Beginner Friendly Explanation || String || EASY
9:46
Length of Last Word - Leetcode 58 || Beginner Friendly Explanation || String || EASY
Count Subarrays With Fixed Bounds - Leetcode 2444 || Two Pointers || cpp || ✅✅✅🔥🔥
22:34
Count Subarrays With Fixed Bounds - Leetcode 2444 || Two Pointers || cpp || ✅✅✅🔥🔥