# Algorithms

## Maximize It!

Problem Statement You are given a list of K lists, each of which contains N positive integers. You need to pick one number from each list such that the sum of the chosen numbers is less than or equal to a given integer M. Find the maximum possible value of the sum of the chosen …

## Binary Search (#704)

Problem Statement Link: LeetCode Complexity: Easy Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. You must write an algorithm with O(log n) runtime complexity. Example 1: Input: nums = [-1,0,3,5,9,12], target = 9 Output: 4 Explanation: 9 exists in nums and its …

## Median of Two Sorted Arrays

Problem Statement Link: LeetCode Complexity: Hard 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 =  Output: 2.00000 Explanation: merged array = [1,2,3] and median is 2. Example 2: Input: nums1 = [1,2], nums2 = [3,4] Output: …

Scroll to Top