Forwarded from A2SV - Community
Hello fellow coders,
After a brief break, we've returned! Get ready for our fun weekly community coding contest happening every Saturday 🗓. It's your chance to compete with other awesome programmers, learn more about coding, and, most importantly, have a great time! 🥳
🏆 Contest Details:
📅 Date: December 28, 2024
⏰ Time: 6:00 PM
🔗 Link for Contest: Community Weekly Contest - Contest No 7
P.S. Remember to fill out this form to secure your spot for our upcoming community classes and lectures. It’s your golden ticket to enriching experiences you won’t want to miss. 📚✨
After a brief break, we've returned! Get ready for our fun weekly community coding contest happening every Saturday 🗓. It's your chance to compete with other awesome programmers, learn more about coding, and, most importantly, have a great time! 🥳
🏆 Contest Details:
📅 Date: December 28, 2024
⏰ Time: 6:00 PM
🔗 Link for Contest: Community Weekly Contest - Contest No 7
P.S. Remember to fill out this form to secure your spot for our upcoming community classes and lectures. It’s your golden ticket to enriching experiences you won’t want to miss. 📚✨
Google Docs
A2SV Community Waitlist Form
The purpose of this form is to obtain personal information from individuals who have participated in two consecutive A2SV contests. Please note that this form is exclusively meant for individuals who have participated in at least two consecutive A2SV contest…
i am not sure but i heard a news that the G6 result will be announced at the end of next week? did u get the info?
👍4
another interview question
You are given a 0-indexed integer array nums.
Swaps of adjacent elements are able to be performed on nums.
A valid array meets the following conditions:
The largest element (any of the largest elements if there are multiple) is at the rightmost position in the array.
The smallest element (any of the smallest elements if there are multiple) is at the leftmost position in the array.
Return the minimum swaps required to make nums a valid array.
Example 1:
Input: nums = [3,4,5,5,3,1]
Output: 6
Explanation: Perform the following swaps:
- Swap 1: Swap the 3rd and 4th elements, nums is then [3,4,5,3,5,1].
- Swap 2: Swap the 4th and 5th elements, nums is then [3,4,5,3,1,5].
- Swap 3: Swap the 3rd and 4th elements, nums is then [3,4,5,1,3,5].
- Swap 4: Swap the 2nd and 3rd elements, nums is then [3,4,1,5,3,5].
- Swap 5: Swap the 1st and 2nd elements, nums is then [3,1,4,5,3,5].
- Swap 6: Swap the 0th and 1st elements, nums is then [1,3,4,5,3,5].
It can be shown that 6 swaps is the minimum swaps required to make a valid array.
Example 2:
Input: nums = [9]
Output: 0
Explanation: The array is already valid, so we return 0.
Constraints:
1 <= nums.length <= 10^5
1 <= nums[i] <= 10^5
👍3
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