Sum of Mutated Array Closest to Target
LeetCode problem #1300
Binary Search
Given a sorted array of integers and a target value, return the index of the target if found, or -1 if not present.
Kth Smallest Element in Sorted Matrix
Find kth smallest element in row and column sorted matrix using heap
Longest Increasing Subsequence
Find the length of the longest increasing subsequence in an array
Longest Repeated Substring
Find the longest substring that appears at least twice in a string
Median of Two Sorted Arrays
Given two sorted arrays nums1 and nums2, return the median of the two sorted arrays. The overall run time complexity should be O(log(min(m,n))).
Search in Rotated Sorted Array
Given a rotated sorted array and a target value, return the index of the target if found in O(log n) time, or -1 if not present.