วีดีโอ

You are smart + beautiful

Why do we assume that each node object will have a list from its of values for all its leaves? Why do we not have to go through the process of traversal? I do not get it.

You are good at this, please keep going.

This video definitely showed us how to solve it, but I feel like the speed you are providing information and editing the video makes it a little harder to digest and learn what you are teaching. Your older videos were easier to have the concepts click but in this, things are moving too fast.

one of the best explanations for this problem!! i was having so much trouble with this specific question and after listening closely to your explanation and seeing your code, it became so much more clear. thank you! thank you! thank you!!!!!

Nice solution. I did it a little differently by converting to a string. th-cam.com/video/MO1PpDjbVt4/w-d-xo.html

Your video for this is the only one that made it clear how we switch from the left side to the right with pop. It should be so easy to understand, but I was having trouble mentally visioning all the moving parts. Thanks to you showing the flow step by step of the loops, I understand this very well.

"You are doing well, ma'am, and we really appreciate your efforts. However, could you please slow down a bit? We are beginners, and it's hard for us to grasp everything at such speed. Also, we have a small request regarding the attire: as students, when we watch such videos at home, our parents sometimes comment on it, and it creates a little discomfort. Thank you for understanding, and apologies if this comes across the wrong way."

Nice explanation Deepti!

Its a blessing to watch your videos.

Great explanation !!

Amazing effort. Keep it up.

Lovely explanation from a lovely person.

❤your videos.

How to watch the hidden videos?

Loved the explaination! You made it very simple to understand

Great solution video! Request to solve Leetcode Problem 4. Median of Two Sorted Arrays if possible, thank you!

So godo😮

Using the Knuth-Morris-Pratt (KMP) algorithm, which is very efficient for large texts and patterns. The KMP algorithm works in O(m + n) time complexity, where: m is the length of the needle n is the length of the haystack class Solution: def strStr(self, haystack: str, needle: str) -> int: # Step 1: Edge case, if needle is empty, return 0 as per problem statement if len(needle) == 0: return 0 # Step 2: Build the LPS array for the needle def build_lps(needle: str) -> list: lps = [0] * len(needle) # LPS array of the same length as needle length = 0 # Length of the previous longest prefix suffix i = 1 while i < len(needle): if needle[i] == needle[length]: length += 1 lps[i] = length i += 1 else: if length != 0: length = lps[length - 1] # Try the previous longest prefix suffix else: lps[i] = 0 i += 1 return lps # Step 3: Use the LPS array to search for the needle in the haystack lps = build_lps(needle) i = 0 # index for haystack j = 0 # index for needle while i < len(haystack): if haystack[i] == needle[j]: i += 1 j += 1 if j == len(needle): return i - j # Match found, return the start index elif i < len(haystack) and haystack[i] != needle[j]: if j != 0: j = lps[j - 1] # Skip to the next possible match in the needle else: i += 1 # No match found, move to the next character in haystack return -1 # Needle not found in haystack

Two pointer, aur prod variable leke ke lete

great explanation and easy to understand code!! thank you!

those who are here looking for this solution are probably trying to crack FAANG interviews. Every FAANG interviewer knows the heap approach won't cut it anymore. KEKW

Wow great vid and explanation!!

It was a very good explanation.

very nice explanation

👁👄👁

instead of the second while loop we could do "if" cuz we're at most running it once.

# using BFS from collections import deque from typing import List class Solution: def longestConsecutive(self, nums: List[int]) -> int: if not nums: return 0 # Convert nums to set for O(1) lookup num_set = set(nums) visited = set() max_length = 0 def bfs(num): queue = deque([num]) visited.add(num) sequence_length = 1 # Check both directions (left and right) left = right = num # Expand to left while left - 1 in num_set and left - 1 not in visited: left -= 1 queue.append(left) visited.add(left) sequence_length += 1 # Expand to right while right + 1 in num_set and right + 1 not in visited: right += 1 queue.append(right) visited.add(right) sequence_length += 1 return sequence_length # Try BFS from each number that hasn't been visited for num in nums: if num not in visited: max_length = max(max_length, bfs(num)) return max_length

thanks for this solution!

this is the only video i can coprehend for lc. 334. thx

No proper explanation of return statement it's like mugging up

great thank you

I was doing this problem and couldn't figure it out. Glad you uploaded the solution today and I really like the way you walk us through your solution step by step. Kudos for doing this!

Just a quick thought :- if you put that end+=1 on top of max_ones you dont need to +1 inside the max() just (end - start) is enough

great thank you

these also works 🤷‍♂ while even and even.next: odd.next = even.next odd = even.next even.next = odd.next even = odd.next odd.next = even_head return head and while even and even.next: odd.next = odd.next.next # skipping one elem odd = odd.next # updating the odd # doing same for even even.next = even.next.next even = even.next odd.next = even_head return head

haha so simple const str = 'J*ave*d' function removeStarFromStr(str){ if(typeof str !== 'string') return "Invalid Type!!"; let result = [] for(const item of str){ if(item === '*'){ if(result.length > 0){ result.pop() } }else{ result.push(item) } } return result.join("") } console.log(removeStarFromStr(str))

I did not see an import of heapq, for heappush and heappop, and your explanation shown we would get an output of [1,4], while the explanation in leetcode shown an output of [1, 2], what is happening, make me understand

The solution shown in the video is copied from ChatGPT lol

🎉🎉🎉❤❤❤😊😊 super. I can understand that code. But one small doubt. We just removing star before character , but * is stay , that how going to be deleted??? 2 What is the concept ?

Do videos on system design

Elegant and simple + walkthrough for easy understanding code. I enjoy watching your LC videos.

The hashmap explanation made the most sense compared to the other videos I watched. I really like that you go through an example. It helps a lot. Thank you!

Though you're doing fantastic, I have more thing to ask: please slow down. You're explaining things so quickly.

You made my Diwali happy.

Happy Diwali sis✨️ 😊

I Love You, Ma'am ! You are soooo beautiful yet so simple!

PY IS FOR NEWBIES ,DO IT USING C

Thanks!

Loved your solution.