Forwarded from typing.......
You are given a 0-indexed string s consisting of only lowercase English letters, and an integer count. A substring of s is said to be an equal count substring if, for each unique letter in the substring, it appears exactly count times in the substring.
Return the number of equal count substrings in s.
A substring is a contiguous non-empty sequence of characters within a string.
Example 1:
Input: s = "aaabcbbcc", count = 3
Output: 3
Explanation:
The substring that starts at index 0 and ends at index 2 is "aaa".
The letter 'a' in the substring appears exactly 3 times.
The substring that starts at index 3 and ends at index 8 is "bcbbcc".
The letters 'b' and 'c' in the substring appear exactly 3 times.
The substring that starts at index 0 and ends at index 8 is "aaabcbbcc".
The letters 'a', 'b', and 'c' in the substring appear exactly 3 times.
Example 2:
Input: s = "abcd", count = 2
Output: 0
Explanation:
The number of times each letter appears in s is less than count.
Therefore, no substrings in s are equal count substrings, so return 0.
Example 3:
Input: s = "a", count = 5
Output: 0
Explanation:
The number of times each letter appears in s is less than count.
Therefore, no substrings in s are equal count substrings, so return 0
Return the number of equal count substrings in s.
A substring is a contiguous non-empty sequence of characters within a string.
Example 1:
Input: s = "aaabcbbcc", count = 3
Output: 3
Explanation:
The substring that starts at index 0 and ends at index 2 is "aaa".
The letter 'a' in the substring appears exactly 3 times.
The substring that starts at index 3 and ends at index 8 is "bcbbcc".
The letters 'b' and 'c' in the substring appear exactly 3 times.
The substring that starts at index 0 and ends at index 8 is "aaabcbbcc".
The letters 'a', 'b', and 'c' in the substring appear exactly 3 times.
Example 2:
Input: s = "abcd", count = 2
Output: 0
Explanation:
The number of times each letter appears in s is less than count.
Therefore, no substrings in s are equal count substrings, so return 0.
Example 3:
Input: s = "a", count = 5
Output: 0
Explanation:
The number of times each letter appears in s is less than count.
Therefore, no substrings in s are equal count substrings, so return 0
👍5😁2
You are given a sorted array nums of size n and an integer target.
Your task is to find the pair of numbers in the array whose sum is less than or equal to the target and has the largest possible sum.
Return the maximum sum of such a pair. If no valid pair exists, return -1.
Example 1:
Input: nums = [2, 3, 5, 8, 13], target = 10
Output: 10
l
[2, 3, 5, 8, 13],
r
[7,8 , 10]
Explanation: The pair (2, 8) has a sum of 10, which is the largest possible sum less than or equal to 10.
Example 2:
Input: nums = [1, 1, 1, 1], target = 1
Output: -1
Explanation: No pair has a sum less than or equal to 1.
Constraints:
1<=n<=10⁵
Nums is sorted in non-decreasing order.
def targetSum(nums , target):
left = 0
max_ = -1
right = len(nums)-1
while left < right:
sum = nums[left] + nums[right]
if sum == target:
return sum
elif sum > target:
right -=1
elif sum < target:
left += 1
max_ = max(max_,sum)
return max_
👍6
"""
Given a binary array nums, return the maximum number of consecutive 1's in the array.
Example 1:
Input: nums = [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.
Example 2:
Input: nums = [1,0,1,1,0,1]
Output: 2
Constraints:
1 <= nums.length <= 105
nums[i] is either 0 or 1.
"""
Given a binary array nums, return the maximum number of consecutive 1's in the array.
Example 1:
Input: nums = [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.
Example 2:
Input: nums = [1,0,1,1,0,1]
Output: 2
Constraints:
1 <= nums.length <= 105
nums[i] is either 0 or 1.
"""
👍2
Forwarded from Maki Asrat
The is the interview question I just had:
Given a binary array nums, return the maximum number of consecutive 1's in the array if you can flip at most one 0.
Example 1:
Input: nums = [1,0,1,1,0]
Output: 4
Explanation:
- If we flip the first zero, nums becomes [1,1,1,1,0] and we have 4 consecutive ones.
- If we flip the second zero, nums becomes [1,0,1,1,1] and we have 3 consecutive ones.
The max number of consecutive ones is 4.
max_cont= 4
max_count= 3
max_count =4
[1,0,1,1,0]
Example 2:
Input: nums = [1,0,1,1,0,1]
Output: 4
Explanation:
- If we flip the first zero, nums becomes [1,1,1,1,0,1] and we have 4 consecutive ones.
- If we flip the second zero, nums becomes [1,0,1,1,1,1] and we have 4 consecutive ones.
The max number of consecutive ones is 4.
Constraints:
1 <= nums.length <= 105
nums[i] is either 0 or 1.
Given a binary array nums, return the maximum number of consecutive 1's in the array if you can flip at most one 0.
Example 1:
Input: nums = [1,0,1,1,0]
Output: 4
Explanation:
- If we flip the first zero, nums becomes [1,1,1,1,0] and we have 4 consecutive ones.
- If we flip the second zero, nums becomes [1,0,1,1,1] and we have 3 consecutive ones.
The max number of consecutive ones is 4.
max_cont= 4
max_count= 3
max_count =4
[1,0,1,1,0]
Example 2:
Input: nums = [1,0,1,1,0,1]
Output: 4
Explanation:
- If we flip the first zero, nums becomes [1,1,1,1,0,1] and we have 4 consecutive ones.
- If we flip the second zero, nums becomes [1,0,1,1,1,1] and we have 4 consecutive ones.
The max number of consecutive ones is 4.
Constraints:
1 <= nums.length <= 105
nums[i] is either 0 or 1.
Mistakes are proof that you’re trying. Embrace every error as a lesson and keep moving forward
👍5
If you were interviewed, how was your technical interview?
Anonymous Poll
45%
I solved the question with little or no help
20%
I solved the quesiton with help
14%
I didnt solve
20%
just to see the result
👍3🤔1
🎄✨ Merry Christmas! 🎄✨
Wishing you all joy, love, and peace this holiday season.
As for the New Year… umm, is it appropriate to say "Happy New Year" now? 🤔
I mean, we’re rocking the Ethiopian calendar here! 🗓😎
Wishing you all joy, love, and peace this holiday season.
As for the New Year… umm, is it appropriate to say "Happy New Year" now? 🤔
I mean, we’re rocking the Ethiopian calendar here! 🗓😎
🎄10👎1
409. Longest Palindrome
Given a string s which consists of lowercase or uppercase letters, return the length of the longest
palindrome
that can be built with those letters.
Letters are case sensitive, for example, "Aa" is not considered a palindrome.
Example 1:
Input: s = "abccccdd"
Output: 7
Explanation: One longest palindrome that can be built is "dccaccd", whose length is 7.
Example 2:
Input: s = "a"
Output: 1
Explanation: The longest palindrome that can be built is "a", whose length is 1.
Constraints:
1 <= s.length <= 2000
s consists of lowercase and/or uppercase English letters only.
Submit
Given a string s which consists of lowercase or uppercase letters, return the length of the longest
palindrome
that can be built with those letters.
Letters are case sensitive, for example, "Aa" is not considered a palindrome.
Example 1:
Input: s = "abccccdd"
Output: 7
Explanation: One longest palindrome that can be built is "dccaccd", whose length is 7.
Example 2:
Input: s = "a"
Output: 1
Explanation: The longest palindrome that can be built is "a", whose length is 1.
Constraints:
1 <= s.length <= 2000
s consists of lowercase and/or uppercase English letters only.
Submit
👍5
Leetcode with dani
409. Longest Palindrome Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters. Letters are case sensitive, for example, "Aa" is not considered a palindrome. …
can u solve it with out hash?and with only one loop and constant O(1) space?
check this ai it makes study easy https://app.youlearn.ai/learn/content/dc7773a6d5b3
YouLearn AI
Bootstrap
Bootstrap is a framework designed for creating responsive, mobile-first websites, utilizing a grid system and media queries to adapt styles for various devices. It offers ready-to-use components like navbars, tables, and alerts, enhancing development speed…
👍3🔥1
🚀 Daily LeetCode Challenge: Container With Most Water 🚀
Post Content
Hey everyone! 👋
Here’s today’s LeetCode problem to sharpen your problem-solving skills. Let’s dive in! 💻
Problem: Container With Most Water
Difficulty: Medium
Link: Container With Most Water - LeetCode
Problem Statement
You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the i-th line are (i, 0) and (i, height[i]). Find two lines that, together with the x-axis, form a container that holds the most water. Return the maximum amount of water the container can store.
Example
Input:
height = [1, 8, 6, 2, 5, 4, 8, 3, 7]
Output:
49
Explanation:
The container is formed by the lines at indices 1 (height = 8) and 8 (height = 7).
The width of the container is 8 - 1 = 7.
The height of the container is min(8, 7) = 7.
The total area (water held) is width * height = 7 * 7 = 49.
Post Content
Hey everyone! 👋
Here’s today’s LeetCode problem to sharpen your problem-solving skills. Let’s dive in! 💻
Problem: Container With Most Water
Difficulty: Medium
Link: Container With Most Water - LeetCode
Problem Statement
You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the i-th line are (i, 0) and (i, height[i]). Find two lines that, together with the x-axis, form a container that holds the most water. Return the maximum amount of water the container can store.
Example
Input:
height = [1, 8, 6, 2, 5, 4, 8, 3, 7]
Output:
49
Explanation:
The container is formed by the lines at indices 1 (height = 8) and 8 (height = 7).
The width of the container is 8 - 1 = 7.
The height of the container is min(8, 7) = 7.
The total area (water held) is width * height = 7 * 7 = 49.
👍6
🚀 Say Goodbye to Limited AI—Meet DeepSeek-V3! 🌍
Tired of ChatGPT’s limited conversations and dumb replies from other AI? I was too—until I found DeepSeek-V3!
try it
Tired of ChatGPT’s limited conversations and dumb replies from other AI? I was too—until I found DeepSeek-V3!
try it
💯7
Leetcode with dani
🚀 Daily LeetCode Challenge: Container With Most Water 🚀 Post Content Hey everyone! 👋 Here’s today’s LeetCode problem to sharpen your problem-solving skills. Let’s dive in! 💻 Problem: Container With Most Water Difficulty: Medium Link: Container With Most…
Approach
Brute Force: Use two nested loops to check every possible pair of lines.
Time Complexity: O(n²)
Space Complexity: O(1)
Optimized Approach: Use two pointers to traverse the array from both ends.
Time Complexity: O(n)
Space Complexity: O(1)
Solution Code
Explanation
We use two pointers, left and right, to traverse the array from both ends.
The area between the two lines is calculated as width * height, where width = right - left and height = min(height[left], height[right]).
To maximize the area, we move the pointer pointing to the shorter line inward.
This approach ensures we only traverse the array once, making it efficient with a time complexity of O(n).
Additional Resource
LeetCode Container With Most Water Discussion
Brute Force: Use two nested loops to check every possible pair of lines.
Time Complexity: O(n²)
Space Complexity: O(1)
Optimized Approach: Use two pointers to traverse the array from both ends.
Time Complexity: O(n)
Space Complexity: O(1)
Solution Code
def maxArea(height):
left, right = 0, len(height) - 1
max_area = 0
while left < right:
width = right - left
current_height = min(height[left], height[right])
current_area = width * current_height
max_area = max(max_area, current_area)
if height[left] < height[right]:
left += 1
else:
right -= 1
return max_area
# Example usage:
height = [1, 8, 6, 2, 5, 4, 8, 3, 7]
print(maxArea(height)) # Output: 49
Explanation
We use two pointers, left and right, to traverse the array from both ends.
The area between the two lines is calculated as width * height, where width = right - left and height = min(height[left], height[right]).
To maximize the area, we move the pointer pointing to the shorter line inward.
This approach ensures we only traverse the array once, making it efficient with a time complexity of O(n).
Additional Resource
LeetCode Container With Most Water Discussion
👍6👌2
DeepSeek R1, an open-source AI model has overtaken ChatGPT to become the #1 app on the US App Store.
🔥 Problem of the Day: "Maximum Subarray" (Medium)
LeetCode #53 | Topic: Dynamic Programming / Greedy
📝 Problem Statement
Given an integer array nums, find the contiguous subarray with the largest sum. Return the sum.
Example:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6 (Because [4,-1,2,1] sums to 6)
💡 Hints to Get Started
Should you track the current subarray or just its sum?
Pro Tip:Kadane’s Algorithm can solve this in O(n) time!
⏳ Time to Solve: 40 minutes!
Drop your solution in the comments 💬. I’ll post the optimized answer tomorrow
LeetCode #53 | Topic: Dynamic Programming / Greedy
📝 Problem Statement
Given an integer array nums, find the contiguous subarray with the largest sum. Return the sum.
Example:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6 (Because [4,-1,2,1] sums to 6)
💡 Hints to Get Started
Should you track the current subarray or just its sum?
Pro Tip:
⏳ Time to Solve: 40 minutes!
Drop your solution in the comments 💬. I’ll post the optimized answer tomorrow
👍6❤3