Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Pull requests: keep-practicing/leetcode-go

Author
Filter by author
Loading
Label
Filter by label
Loading
Use alt + click/return to exclude labels
or ⇧ + click/return for logical OR
Projects
Filter by project
Loading
Milestones
Filter by milestone
Loading
Reviews
Assignee
Filter by who’s assigned
Assigned to nobody Loading
Sort

Pull requests list

find first and last position of element in sorted array array An array is stored such that the position of each element can be computed from its index binary search a search algorithm that finds the position of target value within a sorted array. double index(two pointers) The Two Pointer Algorithm
#6 by zwfang was merged Dec 20, 2018 Loading... updated Dec 20, 2018
Search in rotated sorted array array An array is stored such that the position of each element can be computed from its index binary search a search algorithm that finds the position of target value within a sorted array.
#7 by zwfang was merged Dec 20, 2018 Loading... updated Dec 20, 2018
Remove element array 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
#9 by zwfang was merged Dec 20, 2018 Loading... updated Dec 20, 2018
26 remove duplicate from sorted array solved array 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
#10 by zwfang was merged Dec 21, 2018 Loading... updated Dec 21, 2018
80 remove duplicates 2 solved array 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
#11 by zwfang was merged Dec 21, 2018 Loading... updated Dec 21, 2018
75 sort colors solved array 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 sort Sorting algorithm is an algorithm that puts elements of a list in a certain order.
#12 by zwfang was merged Dec 21, 2018 Loading... updated Dec 21, 2018
88 merge sorted array solved array 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 sort Sorting algorithm is an algorithm that puts elements of a list in a certain order.
#13 by zwfang was merged Dec 22, 2018 Loading... updated Dec 22, 2018
11 container with most water solved. array 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
#18 by zwfang was merged Dec 26, 2018 Loading... updated Dec 26, 2018
713 subarray product less than k solved. array An array is stored such that the position of each element can be computed from its index Medium Coefficient of difficulty medium sliding window A sliding window is a sub-list that runs over an underlying collection.
#19 by zwfang was merged Dec 28, 2018 Loading... updated Dec 28, 2018
303. Range Sum Query - Immutable array An array is stored such that the position of each element can be computed from its index Easy Coefficient of difficulty easy
#20 by zwfang was merged Dec 28, 2018 Loading... updated Dec 28, 2018
121. Best Time to Buy and Sell Stock array An array is stored such that the position of each element can be computed from its index dynamic programming optimal substructure and overlapping sub-problem are two key attributes for dynamic programming. Easy Coefficient of difficulty easy
#21 by zwfang was merged Dec 28, 2018 Loading... updated Dec 28, 2018
122. Best Time to Buy and Sell Stock II array An array is stored such that the position of each element can be computed from its index Easy Coefficient of difficulty easy Greedy algorithm making the locally optimal choice at each stage with the intent of finding the global optimum.
#22 by zwfang was merged Dec 29, 2018 Loading... updated Dec 29, 2018
674. Longest Continuous Increasing Subsequence array An array is stored such that the position of each element can be computed from its index Easy Coefficient of difficulty easy
#25 by zwfang was merged Dec 30, 2018 Loading... updated Dec 30, 2018
4. Median of Two Sorted Arrays array An array is stored such that the position of each element can be computed from its index binary search a search algorithm that finds the position of target value within a sorted array. Divide and Conquer recursively breaking down a problem into two or more sub-problem of the same or related type. Hard Coefficient of difficulty is hard Recursion solution depends on solutions to smaller instances of the same problem.
#24 by zwfang was merged Dec 30, 2018 Loading... updated Dec 30, 2018
23. Merge k Sorted Lists array An array is stored such that the position of each element can be computed from its index 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 Linked List A Linked list is a linear data structure where each element is a separate object.
#31 by zwfang was merged Jan 2, 2019 Loading... updated Jan 2, 2019
35. Search Insert Position array An array is stored such that the position of each element can be computed from its index binary search a search algorithm that finds the position of target value within a sorted array. Easy Coefficient of difficulty easy
#34 by zwfang was merged Jan 2, 2019 Loading... updated Jan 2, 2019
48. Rotate Image array An array is stored such that the position of each element can be computed from its index Medium Coefficient of difficulty medium
#35 by zwfang was merged Jan 2, 2019 Loading... updated Jan 2, 2019
53. Maximum Subarray array An array is stored such that the position of each element can be computed from its index dynamic programming optimal substructure and overlapping sub-problem are two key attributes for dynamic programming. Easy Coefficient of difficulty easy
#36 by zwfang was merged Jan 2, 2019 Loading... updated Jan 2, 2019
66. Plus One array An array is stored such that the position of each element can be computed from its index Easy Coefficient of difficulty easy math math includes the study of such topics as quantity, structure, space, and change.
#38 by zwfang was merged Jan 2, 2019 Loading... updated Jan 2, 2019
79. Word Search array An array is stored such that the position of each element can be computed from its index Backtracking incrementally builds candidates to the solutions, and abandons a candidate(invalid solution.) Medium Coefficient of difficulty medium
#40 by zwfang was merged Jan 4, 2019 Loading... updated Jan 4, 2019
217. Contains Duplicate array An array is stored such that the position of each element can be computed from its index Easy Coefficient of difficulty easy
#54 by zwfang was merged Jan 7, 2019 Loading... updated Jan 7, 2019
219. Contains Duplicate II array An array is stored such that the position of each element can be computed from its index Easy Coefficient of difficulty easy Hash Table(Map) a structure that can map keys to values.
#55 by zwfang was merged Jan 7, 2019 Loading... updated Jan 7, 2019
179. Largest Number array An array is stored such that the position of each element can be computed from its index Medium Coefficient of difficulty medium sort Sorting algorithm is an algorithm that puts elements of a list in a certain order. string A string is used to represent text. It is comprised of a set of characters.
#68 by zwfang was merged Jan 14, 2019 Loading... updated Jan 14, 2019
136. Single Number🖖 array An array is stored such that the position of each element can be computed from its index bit manipulation the act of algorithmically manipulating bits or other pieces of data shorter than a word Easy Coefficient of difficulty easy Hash Table(Map) a structure that can map keys to values.
#74 by zwfang was merged Feb 1, 2019 Loading... updated Feb 1, 2019
15. 3Sum array 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 Medium Coefficient of difficulty medium
#78 by zwfang was merged Mar 1, 2019 Loading... updated Mar 1, 2019
Previous 1
Previous
ProTip! Filter pull requests by the default branch with base:master.

AltStyle によって変換されたページ (->オリジナル) /