Search results

find first and last position of element in sorted array

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

binary searcha search algorithm that finds the position of target value within a sorted array. a search algorithm that finds the position of target value within a sorted array.

double index(two pointers)The Two Pointer Algorithm The Two Pointer Algorithm

Status: Merged (completed).

keep-practicing/leetcode-gonumber 6

#6 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 20, 2018

· Updated on Dec 20, 2018

Search in rotated sorted array

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

binary searcha search algorithm that finds the position of target value within a sorted array. a search algorithm that finds the position of target value within a sorted array.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 7

#7 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 20, 2018

· Updated on Dec 20, 2018

Remove element

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

double index(two pointers)The Two Pointer Algorithm The Two Pointer Algorithm

Status: Merged (completed).

keep-practicing/leetcode-gonumber 9

#9 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 20, 2018

· Updated on Dec 20, 2018

26 remove duplicate from sorted array solved

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

double index(two pointers)The Two Pointer Algorithm The Two Pointer Algorithm

Status: Merged (completed).

keep-practicing/leetcode-gonumber 10

#10 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 21, 2018

· Updated on Dec 21, 2018

80 remove duplicates 2 solved

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

double index(two pointers)The Two Pointer Algorithm The Two Pointer Algorithm

Status: Merged (completed).

keep-practicing/leetcode-gonumber 11

#11 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 21, 2018

· Updated on Dec 21, 2018

75 sort colors solved

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

double index(two pointers)The Two Pointer Algorithm The Two Pointer Algorithm

sortSorting algorithm is an algorithm that puts elements of a list in a certain order. Sorting algorithm is an algorithm that puts elements of a list in a certain order.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 12

#12 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 21, 2018

· Updated on Dec 21, 2018

88 merge sorted array solved

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

double index(two pointers)The Two Pointer Algorithm The Two Pointer Algorithm

sortSorting algorithm is an algorithm that puts elements of a list in a certain order. Sorting algorithm is an algorithm that puts elements of a list in a certain order.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 13

#13 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 22, 2018

· Updated on Dec 22, 2018

11 container with most water solved.

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

double index(two pointers)The Two Pointer Algorithm The Two Pointer Algorithm

Status: Merged (completed).

keep-practicing/leetcode-gonumber 18

#18 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 26, 2018

· Updated on Dec 26, 2018

713 subarray product less than k solved.

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

MediumCoefficient of difficulty medium Coefficient of difficulty medium

sliding windowA sliding window is a sub-list that runs over an underlying collection. A sliding window is a sub-list that runs over an underlying collection.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 19

#19 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 28, 2018

· Updated on Dec 28, 2018

303. Range Sum Query - Immutable

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

EasyCoefficient of difficulty easy Coefficient of difficulty easy

Status: Merged (completed).

keep-practicing/leetcode-gonumber 20

#20 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 28, 2018

· Updated on Dec 28, 2018

121. Best Time to Buy and Sell Stock

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

dynamic programmingoptimal substructure and overlapping sub-problem are two key attributes for dynamic programming. optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.

EasyCoefficient of difficulty easy Coefficient of difficulty easy

Status: Merged (completed).

keep-practicing/leetcode-gonumber 21

#21 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 28, 2018

· Updated on Dec 28, 2018

122. Best Time to Buy and Sell Stock II

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

EasyCoefficient of difficulty easy Coefficient of difficulty easy

Greedy algorithmmaking the locally optimal choice at each stage with the intent of finding the global optimum. making the locally optimal choice at each stage with the intent of finding the global optimum.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 22

#22 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 29, 2018

· Updated on Dec 29, 2018