Jatin Sharma

@SanjayDevTech Please Assign it to me.

> Given an array, ‘A’ of **sorted integers** and another non-negative integer k, find if there exist 2 indices i and j such that > > > A[i] - A[j]...

Hi @larissalages , @jaesharma I have created a pull request to add a solution from leetcode:Find Minimum in Rotated Sorted Array II #199 Please take a look at it! Thanks.

@SakshamAgrwl I have added solution to the problem Rotate and delete. Please have a look at it:#59