Solving LeetCode programming problems in Go
N | Problem | Difficulty | Topics |
---|---|---|---|
1 | Two Sum | Easy | #array #hash-table |
2 | Add Two Numbers | Medium | #linked-list #math #recursion |
3 | Longest Substring Without Repeating Characters | Medium | #hash-table #string #sliding-window |
4 | Median of Two Sorted Arrays | Hard | #array #binary-search #divide-and-conquer |
5 | Longest Palindromic Substring | Medium | #string #dynamic-programming |
6 | Zigzag Conversion | Medium | #string |
7 | Reverse Integer | Medium | #math |
8 | String to Integer (atoi) | Medium | #string |
9 | Palindrome Number | Easy | #math |
10 | Regular Expression Matching | Hard | #string #dynamic-programming #recursion |
11 | Container With Most Water | Medium | #array #two-pointers #greedy |
12 | Integer to Roman | Medium | #hash-table #math #string |
13 | Roman to Integer | Easy | #hash-table #math #string |
14 | Longest Common Prefix | Easy | #string |
15 | 3Sum | Medium | #array #two-pointers #sorting |
16 | 3Sum Closest | Medium | #array #two-pointers #sorting |
17 | Letter Combinations of a Phone Number | Medium | #hash-table #string #backtracking |
18 | 4Sum | Medium | #array #two-pointers #sorting |
19 | Remove Nth Node From End of List | Medium | #linked-list #two-pointers |
20 | Valid Parentheses | Easy | #string #stack |
21 | Merge Two Sorted Lists | Easy | #linked-list #recursion |
22 | Generate Parentheses | Medium | #string #dynamic-programming #backtracking |
23 | Merge k Sorted Lists | Hard | #linked-list #divide-and-conquer #heap-priority-queue #merge-sort |
24 | Swap Nodes in Pairs | Medium | #linked-list #recursion |
25 | Reverse Nodes in k-Group | Hard | #linked-list #recursion |
26 | Remove Duplicates from Sorted Array | Easy | #array #two-pointers |
27 | Remove Element | Easy | #array #two-pointers |
28 | Implement strStr() | Easy | #two-pointers #string #string-matching |
29 | Divide Two Integers | Medium | #math #bit-manipulation |
30 | Substring with Concatenation of All Words | Hard | #hash-table #string #sliding-window |
31 | Next Permutation | Medium | #array #two-pointers |
32 | Longest Valid Parentheses | Hard | #string #dynamic-programming #stack |
33 | Search in Rotated Sorted Array | Medium | #array #binary-search |
34 | Find First and Last Position of Element in Sorted Array | Medium | #array #binary-search |
35 | Search Insert Position | Easy | #array #binary-search |
36 | Valid Sudoku | Medium | #array #hash-table #matrix |
37 | Sudoku Solver | Hard | #array #backtracking #matrix |
38 | Count and Say | Medium | #string |
39 | Combination Sum | Medium | #array #backtracking |
40 | Combination Sum II | Medium | #array #backtracking |
41 | First Missing Positive | Hard | #array #hash-table |
42 | Trapping Rain Water | Hard | #array #two-pointers #dynamic-programming #stack #monotonic-stack |
43 | Multiply Strings | Medium | #math #string #simulation |
44 | Wildcard Matching] | Hard | #string #dynamic-programming #greedy #recursion |
45 | Jump Game II | Medium | #array #dynamic-programming #greedy |
46 | Permutations | Medium | #array #backtracking |
47 | Permutations II | Medium | #array #backtracking |
48 | Rotate Image | Medium | #array #math #matrix |
49 | Group Anagrams | Medium | #hash-table #string #sorting |
50 | Pow(x, n) | Medium | #math #recursion |
51 | N-Queens | Hard | #array #backtracking |
52 | N-Queens II | Hard | #backtracking |
53 | Maximum Subarray | Easy | #array #divide-and-conquer #dynamic-programming |
54 | Spiral Matrix | Medium | #array #matrix #simulation |
55 | Jump Game | Medium | #array #dynamic-programming #greedy |
56 | Merge Intervals | Medium | #array #sorting |
57 | Insert Interval | Medium | #array |
58 | Length of Last Word | Easy | #string |
59 | Spiral Matrix II | Medium | #array #matrix #simulation |
60 | Permutation Sequence | Hard | #math #recursion |
61 | Rotate List | Medium | #linked-list #two-pointers |
62 | Unique Paths | Medium | #math #dynamic-programming #combinatorics |
63 | Unique Paths II | Medium | #array #dynamic-programming #matrix |
64 | Minimum Path Sum | Medium | #array #dynamic-programming #matrix |
65 | Valid Number | Hard | #string |
66 | Plus One | Easy | #array #math |
67 | Add Binary | Easy | #math #string #bit-manipulation #simulation |
68 | Text Justification | Hard | #array #string #simulation |
69 | Sqrt(x) | Easy | #math #binary-search |
70 | Climbing Stairs | Easy | #math #dynamic-programming #memoization |
72 | Edit Distance | Hard | #string #dynamic-programming |
71 | Simplify Path | Medium | #string #stack |
73 | Set Matrix Zeroes | Medium | #array #hash-table #matrix |
74 | Search a 2D Matrix | Medium | #array #binary-search #matrix |
75 | Sort Colors | Medium | #array #two-pointers #sorting |
76 | Minimum Window Substring | Hard | #hash-table #string #sliding-window |
77 | Combinations | Medium | #array #backtracking |
78 | Subsets | Medium | #array #backtracking #bit-manipulation |
79 | Word Search | Medium | #array #backtracking #matrix |
80 | Remove Duplicates from Sorted Array II | Medium | #array #two-pointers |
81 | Search in Rotated Sorted Array II | Medium | |
82 | Remove Duplicates from Sorted List II | Medium | #linked-list #two-pointers |
83 | Remove Duplicates from Sorted List | Easy | #linked-list |
84 | Largest Rectangle in Histogram | Hard | #array #stack #monotonic-stack |
85 | Maximal Rectangle | Hard | #array #dynamic-programming #stack #matrix #monotonic-stack |
... | ... | ... | |
153 | Find Minimum in Rotated Sorted Array | Medium | #array #binary-search |
162 | Find Peak Element | Medium | #array #binary-search |
278 | First Bad Version | Easy | #binary-search #interactive |
374 | Guess Number Higher or Lower | Easy | #binary-search #interactive |
448 | Find All Numbers Disappeared in an Array | Easy | #array #hash-table |
461 | Hamming Distance | Easy | #bit-manipulation |
540 | Single Element in a Sorted Array | Medium | #array #binary-search |
704 | Binary Search | Easy | #array #binary-search |