Ryan’s leetcode Blog

Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is ...

Follow up for "Remove Duplicates": What if duplicates are allowed at most  twice ? For example, Given sorted array A =  [1,1,...

Given a sorted array, remove the duplicates in place such that each element appear only  once  and return the new length. Do not allocate...

Write an efficient algorithm that searches for a value in an m x n matrix, return the occurrence of it. This matrix has the following pro...

A peak element is an element that is greater than its neighbors. Given an input array where  num[i] ≠ num[i+1] , find a peak element and ...

The code base version is an integer and start from 1 to n. One day, someone commit a bad version in the code case, so it caused itself and ...

Write an efficient algorithm that searches for a value in an  m  x  n  matrix. This matrix has the following properties: Integers in ea...