Loading...

Wellesley College Computer Science Club

About

The Wellesley Computer Science Club is dedicated to fostering community within the Computer Science community through events focused on technology, professional development, and academic enrichment. We strive to provide opportunities for students to connect, collaborate, and deepen their engagement with computer science both inside and outside the classroom.

Calendar

only available to Wellesley students

Resources

CS Course Pre-requisite Diagram Tech Recruitment Guide CS Club Tech Referrals List Job Posting Github

Meet the Eboard!

Question of the Week

Median of Two Sorted Arrays

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)).

 

Example 1:

Input: nums1 = [1,3], nums2 = [2]
Output: 2.00000
Explanation: merged array = [1,2,3] and median is 2.

Example 2:

Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.50000
Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.

 

Constraints:

  • nums1.length == m
  • nums2.length == n
  • 0 <= m <= 1000
  • 0 <= n <= 1000
  • 1 <= m + n <= 2000
  • -106 <= nums1[i], nums2[i] <= 106

HINT

How could you break this problem down into smaller parts?


Contact

email us for inquiries

Follow Us on Instagram!