ch
Feedback

不要被骗子欺骗!Telemetrio 会找到并标记这些频道 👉 如果想查看标记,请订阅

Leetcode with dani

Leetcode with dani

前往频道在 Telegram

Join us and let's tackle leet code questions together: improve your problem-solving skills Preparing for coding interviews learning new algorithms and data structures connect with other coding enthusiasts

显示更多
1 240
订阅者
-124 小时
-37 天
-1730 天
帖子存档
▎1. 3Sum def threeSum(nums):     nums.sort()     result = []     for i in range(len(nums) - 2):         if i > 0 and nums[i] == nums[i - 1]:             continue         left, right = i + 1, len(nums) - 1         while left < right:             total = nums[i] + nums[left] + nums[right]             if total < 0:                 left += 1             elif total > 0:                 right -= 1             else:                 result.append([nums[i], nums[left], nums[right]])                 while left < right and nums[left] == nums[left + 1]:                     left += 1                 while left < right and nums[right] == nums[right - 1]:                     right -= 1                 left += 1                 right -= 1     return result ▎2. Minimum Window Substring from collections import Counter def minWindow(s, t):     if not t or not s:         return ""         dict_t = Counter(t)     required = len(dict_t)         l, r = 0, 0     formed = 0     window_counts = {}         ans = float("inf"), None, None         while r < len(s):         character = s[r]         window_counts[character] = window_counts.get(character, 0) + 1                 if character in dict_t and window_counts[character] == dict_t[character]:             formed += 1                 while l <= r and formed == required:             character = s[l]                         if r - l + 1 < ans[0]:                 ans = (r - l + 1, l, r)                         window_counts[character] -= 1             if character in dict_t and window_counts[character] < dict_t[character]:                 formed -= 1                         l += 1                 r += 1         return "" if ans[0] == float("inf") else s[ans[1]: ans[2] + 1] ▎3. Fruit Into Baskets def totalFruits(fruits):     left, right = 0, 0     basket = {}     max_fruits = 0         while right < len(fruits):         basket[fruits[right]] = basket.get(fruits[right], 0) + 1                 while len(basket) > 2:             basket[fruits[left]] -= 1             if basket[fruits[left]] == 0:                 del basket[fruits[left]]             left += 1                 max_fruits = max(max_fruits, right - left + 1)         right += 1         return max_fruits
02 9月 2024, 04:24

1. 3Sum (Hard)     Answer: The solution involves sorting the array and using a two-pointer technique to find triplets that sum to zero. The time complexity is O(n^2). 2. Minimum Window Substring (Hard)     Answer: Use a sliding window approach to maintain a count of characters and expand/shrink the window until the minimum substring is found. The time complexity is O(n). 3. Fruit Into Baskets (Easy)     Answer: Utilize a sliding window to track the types of fruits and their counts, ensuring you only have two types at any time. The maximum length of the window gives the answer. The time complexity is O(n).
02 9月 2024, 04:20

here are a list of airdrops that may have good reward checks it out! CATS BLUM BLUM MAJOR FINTOP DUCK SEED AGENT301
31 8月 2024, 17:48
16 10月 2024, ~13:02

here are a list of airdrops that may have good reward checks it our!! CATS BLUM BLUM MAJOR FINTOP DUCK SEED AGENT301
31 8月 2024, 17:48
31 8月 2024, ~17:48

here are a list of airdrops that may have good reward checks it our!! CATS BLUM BLUM MAJOR FINTOP DUCK SEED AGENT301
31 8月 2024, 17:48
31 8月 2024, ~17:48

here are good airdrops may have good rewards check it out CATS BLUM BLUM FINTOP DUCK SEED AGENT301
31 8月 2024, 17:46
31 8月 2024, ~17:46

Understanding the constraints, time complexity is key to solving LeetCode problems effectively. If you find these concepts co
Understanding the constraints, time complexity is key to solving LeetCode problems effectively. If you find these concepts confusing, don’t worry , you’re not alone!. this might help you to undestand the constraints
31 8月 2024, 06:40

3. Fruit Into Baskets (Easy) Description: You are visiting a farm and have a basket that can hold at most two types of fruits. You want to maximize the number of fruits you collect. Given an array of integers representing the types of fruits in a row, find the maximum number of fruits you can collect in one basket. - Example: For input [1,2,1], the maximum number of fruits collected is 3.
30 8月 2024, 03:39

2. Minimum Window Substring (Hard) Description: Given two strings s and t, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return an empty string. - Example: For s = "ADOBECODEBANC" and t = "ABC", the minimum window is "BANC".
30 8月 2024, 03:38

1. 3Sum (Hard) Description: Given an integer array nums, return all unique triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. - Example: For input nums = [-1,0,1,2,-1,-4], the output should be [[-1,-1,2],[-1,0,1]].
30 8月 2024, 03:38

Python Tips: Two Confusing methods. strip() and split() Methods strip(): This method removes any leading or trailing spaces or specific characters from a string.
  text = "  Hello, World!  "
  print(text.strip())  # Output: "Hello, World!"
  
split(): This method splits a string into a list of substrings based on a specified separator.
  data = "apple,banana,cherry"
  print(data.split(','))  # Output: ['apple', 'banana', 'cherry']
  
To see split() in action, check out the [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) problem on LeetCode, where you'll split version strings using a dot (.) as the separator.
29 8月 2024, 17:43

any one who wants to sell dogs talks to me https://t.me/askeber i will buy with good price
29 8月 2024, 08:20

Do u want to join A2Sv?
Anonymous voting
29 8月 2024, 07:51

🌟 Finding the Majority Element in an Array 🌟 Have you ever wondered how to identify the element that appears more than half the time in an array? 🤔 Let’s dive into a clever algorithm that does just that: The Boyer-Moore Voting Algorithm! 🗳 ▎🔍 How It Works: 1. Initialization: - Start with two variables: - candidate = None - count = 0 2. Candidate Selection: - Loop through each element in the array: - If count is 0, set the current element as the new candidate. - If the current element matches the candidate, increase count. - If it doesn’t match, decrease count. 3. Verification (Optional): - After the first pass, you can run through the array again to confirm that your candidate is indeed the majority element! ▎📈 Why Use This Algorithm? - Time Complexity: \\( O(n) \\) – Efficiently processes the array in linear time! - Space Complexity: \\( O(1) \\) – Uses only a constant amount of extra space! ▎🚀 Example: Consider the array: [2, 2, 1, 1, 1, 2, 2]. - The algorithm will help you find that 2 is the majority element! 🎉 This method is not only efficient but also elegant.
29 8月 2024, 06:59

Sure! Here's a more engaging and visually appealing version for your Telegram channel: --- 🌟 Finding the Majority Element in an Array 🌟 Have you ever wondered how to identify the element that appears more than half the time in an array? 🤔 Let’s dive into a clever algorithm that does just that: The Boyer-Moore Voting Algorithm! 🗳 ▎🔍 How It Works: 1. Initialization: - Start with two variables: - candidate = None - count = 0 2. Candidate Selection: - Loop through each element in the array: - If count is 0, set the current element as the new candidate. - If the current element matches the candidate, increase count. - If it doesn’t match, decrease count. 3. Verification (Optional): - After the first pass, you can run through the array again to confirm that your candidate is indeed the majority element! ▎📈 Why Use This Algorithm? - Time Complexity: \\( O(n) \\) – Efficiently processes the array in linear time! - Space Complexity: \\( O(1) \\) – Uses only a constant amount of extra space! ▎🚀 Example: Consider the array: [2, 2, 1, 1, 1, 2, 2]. - The algorithm will help you find that 2 is the majority element! 🎉 This method is not only efficient but also elegant. Give it a try in your next coding challenge! 💻✨ --- Feel free to customize any part to better fit your style or audience!
29 8月 2024, 06:58
29 8月 2024, ~06:59

🎉 I've won 0.6 USDT! Click the link to help me earn more! You can also play & win money! 💰 👇 Join now and let's earn more together! 👇
29 8月 2024, 03:49
29 8月 2024, ~06:57

Can you solve this? With in 20 min. Challenge ur self
28 8月 2024, 13:31

Question: Find the majority element in an array, which is defined as the element that appears more than n/2 times. Use an efficient algorithm to solve this in linear time O(n) and constant space O(1).
28 8月 2024, 13:30

Count distinct elements in every window of size k Given an array of size N and an integer K, return the count of distinct numbers in all windows of size K. Examples: Input: arr[] = {1, 2, 1, 3, 4, 2, 3}, K = 4 Output: 3 4 4 3 Explanation: First window is {1, 2, 1, 3}, count of distinct numbers is 3 Second window is {2, 1, 3, 4} count of distinct numbers is 4 Third window is {1, 3, 4, 2} count of distinct numbers is 4 Fourth window is {3, 4, 2, 3} count of distinct numbers is 3 Input: arr[] = {1, 2, 4, 4}, K = 2 Output: 2 2 1 Explanation: First window is {1, 2}, count of distinct numbers is 2 First window is {2, 4}, count of distinct numbers is 2 First window is {4, 4}, count of distinct numbers is 1
28 8月 2024, 08:40