Search results

add brute force solution for 0001-two-sum

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

Status: Merged (completed).

keep-practicing/leetcode-gonumber 85

#85 In keep-practicing/leetcode-go;

· by zwfang was closed on Oct 4, 2019

15. 3Sum

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

MediumCoefficient of difficulty medium Coefficient of difficulty medium

Status: Merged (completed).

keep-practicing/leetcode-gonumber 78

#78 In keep-practicing/leetcode-go;

· by zwfang was closed on Mar 1, 2019

136. Single Number🖖

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

bit manipulationthe act of algorithmically manipulating bits or other pieces of data shorter than a word the act of algorithmically manipulating bits or other pieces of data shorter than a word

EasyCoefficient of difficulty easy Coefficient of difficulty easy

Hash Table(Map)a structure that can map keys to values. a structure that can map keys to values.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 74

#74 In keep-practicing/leetcode-go;

· by zwfang was closed on Feb 1, 2019

179. Largest Number

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

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.

stringA string is used to represent text. It is comprised of a set of characters. A string is used to represent text. It is comprised of a set of characters.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 68

#68 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 14, 2019

219. Contains Duplicate 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

Hash Table(Map)a structure that can map keys to values. a structure that can map keys to values.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 55

#55 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 7, 2019

217. Contains Duplicate

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 54

#54 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 7, 2019

79. Word Search

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

Backtrackingincrementally builds candidates to the solutions, and abandons a candidate(invalid solution.) incrementally builds candidates to the solutions, and abandons a candidate(invalid solution.)

MediumCoefficient of difficulty medium Coefficient of difficulty medium

Status: Merged (completed).

keep-practicing/leetcode-gonumber 40

#40 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 4, 2019

66. Plus One

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

mathmath includes the study of such topics as quantity, structure, space, and change. math includes the study of such topics as quantity, structure, space, and change.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 38

#38 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 2, 2019

53. Maximum Subarray

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 36

#36 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 2, 2019

48. Rotate Image

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

Status: Merged (completed).

keep-practicing/leetcode-gonumber 35

#35 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 2, 2019

35. Search Insert Position

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.

EasyCoefficient of difficulty easy Coefficient of difficulty easy

Status: Merged (completed).

keep-practicing/leetcode-gonumber 34

#34 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 2, 2019

23. Merge k Sorted Lists

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

HardCoefficient of difficulty is hard Coefficient of difficulty is hard

heap(priority queue)a heap is a specialized tree-based data structure which is essentially an almost complete tree a heap is a specialized tree-based data structure which is essentially an almost complete tree

Linked ListA Linked list is a linear data structure where each element is a separate object. A Linked list is a linear data structure where each element is a separate object.

Status: Merged (completed).

keep-practicing/leetcode-gonumber 31

#31 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 2, 2019