Algorithm Challenges

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each in...

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears **at most twice**. Th...

Given an integer array nums and an integer val, remove all occurrences of val in nums **in-place**. The order of the elements may be changed. Then ret...

You are given two integer arrays nums1 and nums2, sorted in **non-decreasing order**, and two integers m and n, representing the number of elements in...