Coding Challenges & Hustle Talk at FriendZone
Summary
FriendZone | Make Friends & Chat ⋅ Active Social Fun ⋅ Chill ⋅ VC is buzzing with members discussing technical coding challenges and collaborative side hustles. This announcement highlights the community's unique blend of intellectual problem-solving and entrepreneurial spirit. Whether you are looking to sharpen your programming skills or connect with like-minded individuals to build something new, our server provides the perfect space for social interaction and growth.
Looking for someone to talk to… vibe and talk about making money together
if u solve this, ill consider about making money together
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
The overall run time complexity should be O(log (m+n))
Bro really?
yup fr but no gpt n stuff
def findMedianSortedArrays(nums1, nums2):
# Always binary-search the smaller array
if len(nums1) > len(nums2):
nums1, nums2 = nums2, nums1
m, n = len(nums1), len(nums2)
left, right = 0, m
half = (m + n + 1) // 2
while left <= right:
i = (left + right) // 2
j = half - i
# Boundary values
Aleft = nums1[i - 1] if i > 0 else float("-inf")
Aright = nums1[i] if i < m else float("inf")
Bleft = nums2[j - 1] if j > 0 else float("-inf")
Bright = nums2[j] if j < n else float("inf")
# Correct partition
if Aleft <= Bright and Bleft <= Aright:
if (m + n) % 2 == 1:
return max(Aleft, Bleft)
return (max(Aleft, Bleft) + min(Aright, Bright)) / 2
# Too far right in nums1
elif Aleft > Bright:
right = i - 1
# Too far left in nums1
else:
left = i + 1
holy ai
🤫✌
😖
Real 😂
Bro what’s your deal tho
im hunting larp coders
Me
jus go to school
At night?
night?
Yh
Makes sense
Man I tryna hustle
Let’s all make banks you know put some ideas on
HI , Eve 27 F ! M gamer.. Chill, fun , 21+
Then
Say moree
