https://github.com/mrbelka12000/leetcode_training

Collection of LeetCode problems solved with Go/Golang
https://github.com/mrbelka12000/leetcode_training
algo dsa sql
Last synced: 4 months ago
JSON representation
Collection of LeetCode problems solved with Go/Golang
Host: GitHub
URL: https://github.com/mrbelka12000/leetcode_training
Owner: mrbelka12000
Created: 2023-10-10T20:16:08.000Z (over 1 year ago)
Default Branch: main
Last Pushed: 2025-01-27T12:21:32.000Z (5 months ago)
Last Synced: 2025-01-27T13:37:43.962Z (5 months ago)
Topics: algo, dsa, sql
Language: Go
Homepage: https://leetcode.com
Size: 4.89 MB
Stars: 1
Watchers: 2
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md
Awesome Lists containing this project

README

        # leetcode_training

![LeetCode Stats](https://leetcard.jacoblin.cool/mrbelka12000?theme=nord&font=Nunito%20Sans&ext=heatmap&cache=0)

### Collection of leetcode problems solved and noted by me (list of problems not full)

### Statistics by months and years:

![plot](plot.png)

### List of problems(541):

| N | Title | Difficulty |Link | Code |

|---|-------|------|------|------|

|2 | Add Two Numbers |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/add-two-numbers/description/) | [Code](linked_list/2/main.go)|

|5 | Longest Palindromic Substring |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-palindromic-substring/description/) | [Code](string/5/main.go)|

|12 | Integer to Roman |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/integer-to-roman/description/) | [Code](hash_table/12/main.go)|

|16 | 3Sum Closest |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/3sum-closest/description/) | [Code](array/16/main.go)|

|17 | Letter Combinations of a Phone Number |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/) | [Code](backtracking/17/main.go)|

|18 | 4Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/4sum/description/) | [Code](array/18/main.go)|

|22 | Generate Parentheses |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/generate-parentheses/description/) | [Code](stack/22/main.go)|

|23 | Merge k Sorted Lists |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/merge-k-sorted-lists/description/) | [Code](linked_list/23/main.go)|

|24 | Swap Nodes in Pairs |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/swap-nodes-in-pairs/description/) | [Code](linked_list/24/main.go)|

|25 | Reverse Nodes in k-Group |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/reverse-nodes-in-k-group/description/) | [Code](linked_list/25/main.go)|

|30 | Substring with Concatenation of All Words |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/) | [Code](sliding_window/30/main.go)|

|31 | Next Permutation |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/next-permutation/description/) | [Code](math/31/main.go)|

|32 | Longest Valid Parentheses |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/longest-valid-parentheses/description/) | [Code](stack/32/main.go)|

|37 | Sudoku Solver |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/sudoku-solver/description/) | [Code](backtracking/37/main.go)|

|39 | Combination Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/combination-sum/description/) | [Code](backtracking/39/main.go)|

|40 | Combination Sum II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/combination-sum-ii/description/) | [Code](backtracking/40/main.go)|

|42 | Trapping Rain Water |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/trapping-rain-water/description/) | [Code](dp/42/main.go)|

|45 | Jump Game II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/jump-game-ii/description/) | [Code](dp/45/main.go)|

|46 | Permutations |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/permutations/description/) | [Code](backtracking/46/main.go)|

|47 | Permutations II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/permutations-ii/description/) | [Code](backtracking/47/main.go)|

|48 | Rotate Image |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/rotate-image/description/) | [Code](array/48/main.go)|

|51 | N-Queens |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/n-queens/description/) | [Code](backtracking/51/main.go)|

|52 | N-Queens II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/n-queens-ii/description/) | [Code](backtracking/52/main.go)|

|54 | Spiral Matrix |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/spiral-matrix/description/) | [Code](matrix/54/main.go)|

|59 | Spiral Matrix II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/spiral-matrix-ii/description/) | [Code](array/59/main.go)|

|61 | Rotate List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/rotate-list/description/) | [Code](linked_list/61/main.go)|

|62 | Unique Paths |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/unique-paths/description/) | [Code](dp/62/main.go)|

|63 | Unique Paths II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/unique-paths-ii/description/) | [Code](dp/63/main.go)|

|64 | Minimum Path Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-path-sum/description/) | [Code](dp/64/main.go)|

|68 | Text Justification |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/text-justification/description/) | [Code](string/68/main.go)|

|71 | Simplify Path |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/simplify-path/description/) | [Code](stack/71/main.go)|

|72 | Edit Distance |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/edit-distance/description/) | [Code](dp/72/main.go)|

|76 | Minimum Window Substring |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/minimum-window-substring/description/) | [Code](sliding_window/76/main.go)|

|77 | Combinations |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/combinations/description/) | [Code](backtracking/77/main.go)|

|79 | Word Search |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/word-search/description/) | [Code](backtracking/79/main.go)|

|81 | Search in Rotated Sorted Array II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/description/) | [Code](array/81/main.go)|

|82 | Remove Duplicates from Sorted List II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/) | [Code](linked_list/82/main.go)|

|84 | Largest Rectangle in Histogram |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/largest-rectangle-in-histogram/description/) | [Code](monotonic_stack/84/main.go)|

|92 | Reverse Linked List II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reverse-linked-list-ii/description/) | [Code](linked_list/92/main.go)|

|93 | Restore IP Addresses |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/restore-ip-addresses/description/) | [Code](backtracking/93/main.go)|

|97 | Interleaving String |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/interleaving-string/description/) | [Code](dp/97/main.go)|

|98 | Validate Binary Search Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/validate-binary-search-tree/description/) | [Code](btree/98/main.go)|

|102 | Binary Tree Level Order Traversal |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) | [Code](btree/102/main.go)|

|103 | Binary Tree Zigzag Level Order Traversal |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/) | [Code](btree/103/main.go)|

|105 | Construct Binary Tree from Preorder and Inorder Traversal |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/) | [Code](btree/105/main.go)|

|106 | Construct Binary Tree from Inorder and Postorder Traversal |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/) | [Code](btree/106/main.go)|

|107 | Binary Tree Level Order Traversal II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/description/) | [Code](btree/107/main.go)|

|108 | Convert Sorted Array to Binary Search Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/) | [Code](btree/108/main.go)|

|109 | Convert Sorted List to Binary Search Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/description/) | [Code](linked_list/109/main.go)|

|110 | Balanced Binary Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/balanced-binary-tree/description/) | [Code](btree/110/main.go)|

|112 | Path Sum |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/path-sum/description/) | [Code](btree/112/main.go)|

|113 | Path Sum II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/path-sum-ii/description/) | [Code](btree/113/main.go)|

|114 | Flatten Binary Tree to Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/) | [Code](btree/114/main.go)|

|116 | Populating Next Right Pointers in Each Node |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/description/) | [Code](btree/116/main.go)|

|117 | Populating Next Right Pointers in Each Node II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/description/) | [Code](btree/117/main.go)|

|124 | Binary Tree Maximum Path Sum |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/binary-tree-maximum-path-sum/description/) | [Code](btree/124/main.go)|

|127 | Word Ladder |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/word-ladder/description/) | [Code](graph/127/main.go)|

|129 | Sum Root to Leaf Numbers |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/sum-root-to-leaf-numbers/description/) | [Code](btree/129/main.go)|

|130 | Surrounded Regions |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/surrounded-regions/description/) | [Code](matrix/130/main.go)|

|131 | Palindrome Partitioning |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/palindrome-partitioning/description/) | [Code](backtracking/131/main.go)|

|133 | Clone Graph |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/clone-graph/description/) | [Code](graph/133/main.go)|

|134 | Gas Station |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/gas-station/description/) | [Code](greedy/134/main.go)|

|135 | Candy |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/candy/description/) | [Code](greedy/135/main.go)|

|138 | Copy List with Random Pointer |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/copy-list-with-random-pointer/description/) | [Code](linked_list/138/main.go)|

|139 | Word Break |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/word-break/description/) | [Code](dp/139/main.go)|

|140 | Word Break II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/word-break-ii/description/) | [Code](hash_table/140/main.go)|

|141 | Linked List Cycle |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/linked-list-cycle/description/) | [Code](linked_list/141/main.go)|

|142 | Linked List Cycle II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/linked-list-cycle-ii/description/) | [Code](linked_list/142/main.go)|

|143 | Reorder List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reorder-list/description/) | [Code](linked_list/143/main.go)|

|146 | LRU Cache |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/lru-cache/description/) | [Code](linked_list/146/main.go)|

|148 | Sort List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/sort-list/description/) | [Code](linked_list/148/main.go)|

|150 | Evaluate Reverse Polish Notation |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/evaluate-reverse-polish-notation/description/) | [Code](stack/150/main.go)|

|154 | Find Minimum in Rotated Sorted Array II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/description/) | [Code](binarysearch/154/main.go)|

|159 | Longest Substring with At Most Two Distinct Characters |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/description/) | [Code](sliding_window/159/main.go)|

|160 | Intersection of Two Linked Lists |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/intersection-of-two-linked-lists/description/) | [Code](linked_list/160/main.go)|

|161 | One Edit Distance |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/one-edit-distance/description/) | [Code](string/161/main.go)|

|164 | Maximum Gap |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-gap/description/) | [Code](heap/164/main.go)|

|170 | Two Sum III - Data structure design |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/two-sum-iii---data-structure-design/description/) | [Code](design/170/main.go)|

|172 | Factorial Trailing Zeroes |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/factorial-trailing-zeroes/description/) | [Code](math/172/main.go)|

|173 | Binary Search Tree Iterator |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/binary-search-tree-iterator/description/) | [Code](btree/173/main.go)|

|175 | Combine Two Tables |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/combine-two-tables/description/) | [Code](sql/175/main.go)|

|176 | Second Highest Salary |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/second-highest-salary/description/) | [Code](sql/176/main.go)|

|178 | Rank Scores |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/rank-scores/description/) | [Code](sql/178/main.go)|

|179 | Largest Number |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/largest-number/description/) | [Code](greedy/179/main.go)|

|186 | Reverse Words in a String II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reverse-words-in-a-string-ii/description/) | [Code](string/186/main.go)|

|187 | Repeated DNA Sequences |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/repeated-dna-sequences/description/) | [Code](sliding_window/187/main.go)|

|188 | Best Time to Buy and Sell Stock IV |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/description/) | [Code](dp/188/main.go)|

|204 | Count Primes |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-primes/description/) | [Code](array/204/main.go)|

|207 | Course Schedule |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/course-schedule/description/) | [Code](graph/207/main.go)|

|208 | Implement Trie (Prefix Tree) |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/implement-trie-(prefix-tree)/description/) | [Code](trie/208/main.go)|

|210 | Course Schedule II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/course-schedule-ii/description/) | [Code](topological_sort/210/main.go)|

|211 | Design Add and Search Words Data Structure |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-add-and-search-words-data-structure/description/) | [Code](design/211/main.go)|

|212 | Word Search II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/word-search-ii/description/) | [Code](trie/212/main.go)|

|216 | Combination Sum III |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/combination-sum-iii/description/) | [Code](backtracking/216/main.go)|

|224 | Basic Calculator |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/basic-calculator/description/) | [Code](stack/224/main.go)|

|227 | Basic Calculator II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/basic-calculator-ii/description/) | [Code](stack/227/main.go)|

|228 | Summary Ranges |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/summary-ranges/description/) | [Code](array/228/main.go)|

|229 | Majority Element II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/majority-element-ii/description/) | [Code](hash_table/229/main.go)|

|230 | Kth Smallest Element in a BST |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/) | [Code](btree/230/main.go)|

|235 | Lowest Common Ancestor of a Binary Search Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/) | [Code](btree/235/main.go)|

|236 | Lowest Common Ancestor of a Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/) | [Code](btree/236/main.go)|

|237 | Delete Node in a Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/delete-node-in-a-linked-list/description/) | [Code](linked_list/237/main.go)|

|239 | Sliding Window Maximum |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/sliding-window-maximum/description/) | [Code](array/239/main.go)|

|240 | Search a 2D Matrix II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/search-a-2d-matrix-ii/description/) | [Code](binarysearch/240/main.go)|

|246 | Strobogrammatic Number |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/strobogrammatic-number/description/) | [Code](string/246/main.go)|

|247 | Strobogrammatic Number II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/strobogrammatic-number-ii/description/) | [Code](backtracking/247/main.go)|

|250 | Count Univalue Subtrees |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-univalue-subtrees/description/) | [Code](btree/250/main.go)|

|252 | Meeting Rooms |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/meeting-rooms/description/) | [Code](array/252/main.go)|

|253 | Meeting Rooms II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/meeting-rooms-ii/description/) | [Code](array/253/main.go)|

|254 | Factor Combinations |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/factor-combinations/description/) | [Code](backtracking/254/main.go)|

|256 | Paint House |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/paint-house/description/) | [Code](dp/256/main.go)|

|257 | Binary Tree Paths |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/binary-tree-paths/description/) | [Code](btree/257/main.go)|

|259 | 3Sum Smaller |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/3sum-smaller/description/) | [Code](binarysearch/259/main.go)|

|261 | Graph Valid Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/graph-valid-tree/description/) | [Code](union_find/261/main.go)|

|267 | Palindrome Permutation II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/palindrome-permutation-ii/description/) | [Code](backtracking/267/main.go)|

|270 | Closest Binary Search Tree Value |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/closest-binary-search-tree-value/description/) | [Code](btree/270/main.go)|

|271 | Encode and Decode Strings |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/encode-and-decode-strings/description/) | [Code](string/271/main.go)|

|272 | Closest Binary Search Tree Value II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/closest-binary-search-tree-value-ii/description/) | [Code](btree/272/main.go)|

|274 | H-Index |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/h-index/description/) | [Code](array/274/main.go)|

|282 | Expression Add Operators |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/expression-add-operators/description/) | [Code](backtracking/282/main.go)|

|284 | Peeking Iterator |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/peeking-iterator/description/) | [Code](design/284/main.go)|

|286 | Walls and Gates |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/walls-and-gates/description/) | [Code](matrix/286/main.go)|

|289 | Game of Life |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/game-of-life/description/) | [Code](matrix/289/main.go)|

|290 | Word Pattern |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/word-pattern/description/) | [Code](hash_table/290/main.go)|

|295 | Find Median from Data Stream |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/find-median-from-data-stream/description/) | [Code](heap/295/main.go)|

|297 | Serialize and Deserialize Binary Tree |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/) | [Code](btree/297/main.go)|

|300 | Longest Increasing Subsequence |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-increasing-subsequence/description/) | [Code](dp/300/main.go)|

|302 | Smallest Rectangle Enclosing Black Pixels |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/description/) | [Code](matrix/302/main.go)|

|307 | Range Sum Query - Mutable |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/range-sum-query---mutable/description/) | [Code](fenwick_tree/307/main.go)|

|308 | Range Sum Query 2D - Mutable |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/range-sum-query-2d---mutable/description/) | [Code](prefix_sum/308/main.go)|

|314 | Binary Tree Vertical Order Traversal |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/binary-tree-vertical-order-traversal/description/) | [Code](btree/314/main.go)|

|316 | Remove Duplicate Letters |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/remove-duplicate-letters/description/) | [Code](greedy/316/main.go)|

|322 | Coin Change |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/coin-change/description/) | [Code](dp/322/main.go)|

|323 | Number of Connected Components in an Undirected Graph |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/description/) | [Code](union_find/323/main.go)|

|329 | Longest Increasing Path in a Matrix |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/description/) | [Code](dp/329/main.go)|

|340 | Longest Substring with At Most K Distinct Characters |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/description/) | [Code](sliding_window/340/main.go)|

|346 | Moving Average from Data Stream |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/moving-average-from-data-stream/description/) | [Code](design/346/main.go)|

|355 | Design Twitter |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-twitter/description/) | [Code](design/355/main.go)|

|359 | Logger Rate Limiter |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/logger-rate-limiter/description/) | [Code](design/359/main.go)|

|366 | Find Leaves of Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-leaves-of-binary-tree/description/) | [Code](btree/366/main.go)|

|368 | Largest Divisible Subset |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/largest-divisible-subset/description/) | [Code](dp/368/main.go)|

|369 | Plus One Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/plus-one-linked-list/description/) | [Code](linked_list/369/main.go)|

|373 | Find K Pairs with Smallest Sums |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/description/) | [Code](heap/373/main.go)|

|377 | Combination Sum IV |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/combination-sum-iv/description/) | [Code](dp/377/main.go)|

|378 | Kth Smallest Element in a Sorted Matrix |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/description/) | [Code](array/378/main.go)|

|380 | Insert Delete GetRandom O(1) |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/insert-delete-getrandom-o(1)/description/) | [Code](design/380/main.go)|

|384 | Shuffle an Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/shuffle-an-array/description/) | [Code](design/384/main.go)|

|386 | Lexicographical Numbers |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/lexicographical-numbers/description/) | [Code](trie/386/main.go)|

|390 | Elimination Game |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/elimination-game/description/) | [Code](math/390/main.go)|

|397 | Integer Replacement |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/integer-replacement/description/) | [Code](math/397/main.go)|

|398 | Random Pick Index |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/random-pick-index/description/) | [Code](hash_table/398/main.go)|

|399 | Evaluate Division |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/evaluate-division/description/) | [Code](graph/399/main.go)|

|404 | Sum of Left Leaves |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/sum-of-left-leaves/description/) | [Code](btree/404/main.go)|

|409 | Longest Palindrome |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/longest-palindrome/description/) | [Code](greedy/409/main.go)|

|413 | Arithmetic Slices |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/arithmetic-slices/description/) | [Code](dp/413/main.go)|

|416 | Partition Equal Subset Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/partition-equal-subset-sum/description/) | [Code](dp/416/main.go)|

|422 | Valid Word Square |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/valid-word-square/description/) | [Code](matrix/422/main.go)|

|424 | Longest Repeating Character Replacement |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-repeating-character-replacement/description/) | [Code](sliding_window/424/main.go)|

|431 | Encode N-ary Tree to Binary Tree |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree/description/) | [Code](design/431/main.go)|

|433 | Minimum Genetic Mutation |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-genetic-mutation/description/) | [Code](hash_table/433/main.go)|

|436 | Find Right Interval |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-right-interval/description/) | [Code](binarysearch/436/main.go)|

|437 | Path Sum III |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/path-sum-iii/description/) | [Code](btree/437/main.go)|

|441 | Arranging Coins |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/arranging-coins/description/) | [Code](math/441/main.go)|

|445 | Add Two Numbers II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/add-two-numbers-ii/description/) | [Code](linked_list/445/main.go)|

|446 | Arithmetic Slices II - Subsequence |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/arithmetic-slices-ii---subsequence/description/) | [Code](dp/446/main.go)|

|452 | Minimum Number of Arrows to Burst Balloons |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/) | [Code](array/452/main.go)|

|455 | Assign Cookies |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/assign-cookies/description/) | [Code](array/455/main.go)|

|460 | LFU Cache |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/lfu-cache/description/) | [Code](linked_list/460/main.go)|

|487 | Max Consecutive Ones II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/max-consecutive-ones-ii/description/) | [Code](sliding_window/487/main.go)|

|491 | Non-decreasing Subsequences |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/non-decreasing-subsequences/description/) | [Code](backtracking/491/main.go)|

|494 | Target Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/target-sum/description/) | [Code](backtracking/494/main.go)|

|496 | Next Greater Element I |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/next-greater-element-i/description/) | [Code](monotonic_stack/496/main.go)|

|502 | IPO |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/ipo/description/) | [Code](greedy/502/main.go)|

|503 | Next Greater Element II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/next-greater-element-ii/description/) | [Code](monotonic_stack/503/main.go)|

|506 | Relative Ranks |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/relative-ranks/description/) | [Code](hash_table/506/main.go)|

|513 | Find Bottom Left Tree Value |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-bottom-left-tree-value/description/) | [Code](btree/513/main.go)|

|518 | Coin Change II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/coin-change-ii/description/) | [Code](dp/518/main.go)|

|520 | Detect Capital |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/detect-capital/description/) | [Code](string/520/main.go)|

|525 | Contiguous Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/contiguous-array/description/) | [Code](hash_table/525/main.go)|

|526 | Beautiful Arrangement |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/beautiful-arrangement/description/) | [Code](backtracking/526/main.go)|

|532 | K-diff Pairs in an Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/k-diff-pairs-in-an-array/description/) | [Code](array/532/main.go)|

|538 | Convert BST to Greater Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/convert-bst-to-greater-tree/description/) | [Code](btree/538/main.go)|

|539 | Minimum Time Difference |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-time-difference/description/) | [Code](math/539/main.go)|

|543 | Diameter of Binary Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/diameter-of-binary-tree/description/) | [Code](btree/543/main.go)|

|547 | Number of Provinces |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-provinces/description/) | [Code](union_find/547/main.go)|

|551 | Student Attendance Record I |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/student-attendance-record-i/description/) | [Code](string/551/main.go)|

|559 | Maximum Depth of N-ary Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/description/) | [Code](btree/559/main.go)|

|560 | Subarray Sum Equals K |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/subarray-sum-equals-k/description/) | [Code](prefix_sum/560/main.go)|

|563 | Binary Tree Tilt |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/binary-tree-tilt/description/) | [Code](btree/563/main.go)|

|572 | Subtree of Another Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/subtree-of-another-tree/description/) | [Code](linked_list/572/main.go)|

|575 | Distribute Candies |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/distribute-candies/description/) | [Code](hash_table/575/main.go)|

|576 | Out of Boundary Paths |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/out-of-boundary-paths/description/) | [Code](dp/576/main.go)|

|582 | Kill Process |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/kill-process/description/) | [Code](graph/582/main.go)|

|588 | Design In-Memory File System |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/design-in-memory-file-system/description/) | [Code](design/588/main.go)|

|589 | N-ary Tree Preorder Traversal |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/n-ary-tree-preorder-traversal/description/) | [Code](btree/589/main.go)|

|590 | N-ary Tree Postorder Traversal |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/n-ary-tree-postorder-traversal/description/) | [Code](btree/590/main.go)|

|606 | Construct String from Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/construct-string-from-binary-tree/description/) | [Code](btree/606/main.go)|

|621 | Task Scheduler |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/task-scheduler/description/) | [Code](heap/621/main.go)|

|622 | Design Circular Queue |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-circular-queue/description/) | [Code](design/622/main.go)|

|623 | Add One Row to Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/add-one-row-to-tree/description/) | [Code](btree/623/main.go)|

|630 | Course Schedule III |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/course-schedule-iii/description/) | [Code](heap/630/main.go)|

|636 | Exclusive Time of Functions |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/exclusive-time-of-functions/description/) | [Code](stack/636/main.go)|

|641 | Design Circular Deque |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-circular-deque/description/) | [Code](design/641/main.go)|

|646 | Maximum Length of Pair Chain |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-length-of-pair-chain/description/) | [Code](dp/646/main.go)|

|648 | Replace Words |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/replace-words/description/) | [Code](hash_table/648/main.go)|

|650 | 2 Keys Keyboard |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/2-keys-keyboard/description/) | [Code](dp/650/main.go)|

|654 | Maximum Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-binary-tree/description/) | [Code](btree/654/main.go)|

|655 | Print Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/print-binary-tree/description/) | [Code](btree/655/main.go)|

|658 | Find K Closest Elements |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-k-closest-elements/description/) | [Code](heap/658/main.go)|

|665 | Non-decreasing Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/non-decreasing-array/description/) | [Code](array/665/main.go)|

|671 | Second Minimum Node In a Binary Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/description/) | [Code](btree/671/main.go)|

|676 | Implement Magic Dictionary |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/implement-magic-dictionary/description/) | [Code](design/676/main.go)|

|677 | Map Sum Pairs |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/map-sum-pairs/description/) | [Code](design/677/main.go)|

|678 | Valid Parenthesis String |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/valid-parenthesis-string/description/) | [Code](dp/678/main.go)|

|680 | Valid Palindrome II |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/valid-palindrome-ii/description/) | [Code](greedy/680/main.go)|

|684 | Redundant Connection |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/redundant-connection/description/) | [Code](union_find/684/main.go)|

|687 | Longest Univalue Path |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-univalue-path/description/) | [Code](btree/687/main.go)|

|690 | Employee Importance |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/employee-importance/description/) | [Code](btree/690/main.go)|

|692 | Top K Frequent Words |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/top-k-frequent-words/description/) | [Code](heap/692/main.go)|

|701 | Insert into a Binary Search Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/insert-into-a-binary-search-tree/description/) | [Code](btree/701/main.go)|

|702 | Search in a Sorted Array of Unknown Size |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/description/) | [Code](binarysearch/702/main.go)|

|703 | Kth Largest Element in a Stream |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/kth-largest-element-in-a-stream/description/) | [Code](heap/703/main.go)|

|707 | Design Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-linked-list/description/) | [Code](design/707/main.go)|

|708 | Insert into a Sorted Circular Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/description/) | [Code](linked_list/708/main.go)|

|713 | Subarray Product Less Than K |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/subarray-product-less-than-k/description/) | [Code](sliding_window/713/main.go)|

|721 | Accounts Merge |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/accounts-merge/description/) | [Code](heap/721/main.go)|

|725 | Split Linked List in Parts |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/split-linked-list-in-parts/description/) | [Code](linked_list/725/main.go)|

|728 | Self Dividing Numbers |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/self-dividing-numbers/description/) | [Code](math/728/main.go)|

|729 | My Calendar I |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/my-calendar-i/description/) | [Code](design/729/main.go)|

|739 | Daily Temperatures |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/daily-temperatures/description/) | [Code](monotonic_stack/739/main.go)|

|740 | Delete and Earn |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/delete-and-earn/description/) | [Code](dp/740/main.go)|

|741 | Cherry Pickup |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/cherry-pickup/description/) | [Code](dp/741/main.go)|

|742 | Closest Leaf in a Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/description/) | [Code](btree/742/main.go)|

|743 | Network Delay Time |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/network-delay-time/description/) | [Code](graph/743/main.go)|

|745 | Prefix and Suffix Search |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/prefix-and-suffix-search/description/) | [Code](trie/745/main.go)|

|749 | Contain Virus |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/contain-virus/description/) | [Code](matrix/749/main.go)|

|759 | Employee Free Time |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/employee-free-time/description/) | [Code](stack/759/main.go)|

|763 | Partition Labels |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/partition-labels/description/) | [Code](greedy/763/main.go)|

|767 | Reorganize String |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reorganize-string/description/) | [Code](hash_table/767/main.go)|

|773 | Sliding Puzzle |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/sliding-puzzle/description/) | [Code](backtracking/773/main.go)|

|784 | Letter Case Permutation |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/letter-case-permutation/description/) | [Code](backtracking/784/main.go)|

|785 | Is Graph Bipartite? |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/is-graph-bipartite?/description/) | [Code](union_find/785/main.go)|

|786 | K-th Smallest Prime Fraction |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/k-th-smallest-prime-fraction/description/) | [Code](heap/786/main.go)|

|787 | Cheapest Flights Within K Stops |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/cheapest-flights-within-k-stops/description/) | [Code](graph/787/main.go)|

|790 | Domino and Tromino Tiling |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/domino-and-tromino-tiling/description/) | [Code](dp/790/main.go)|

|792 | Number of Matching Subsequences |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-matching-subsequences/description/) | [Code](array/792/main.go)|

|797 | All Paths From Source to Target |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/all-paths-from-source-to-target/description/) | [Code](graph/797/main.go)|

|802 | Find Eventual Safe States |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-eventual-safe-states/description/) | [Code](topological_sort/802/main.go)|

|814 | Binary Tree Pruning |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/binary-tree-pruning/description/) | [Code](btree/814/main.go)|

|815 | Bus Routes |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/bus-routes/description/) | [Code](hash_table/815/main.go)|

|817 | Linked List Components |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/linked-list-components/description/) | [Code](linked_list/817/main.go)|

|818 | Race Car |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/race-car/description/) | [Code](btree/818/main.go)|

|819 | Most Common Word |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/most-common-word/description/) | [Code](string/819/main.go)|

|821 | Shortest Distance to a Character |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/shortest-distance-to-a-character/description/) | [Code](array/821/main.go)|

|826 | Most Profit Assigning Work |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/most-profit-assigning-work/description/) | [Code](greedy/826/main.go)|

|834 | Sum of Distances in Tree |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/sum-of-distances-in-tree/description/) | [Code](graph/834/main.go)|

|840 | Magic Squares In Grid |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/magic-squares-in-grid/description/) | [Code](matrix/840/main.go)|

|846 | Hand of Straights |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/hand-of-straights/description/) | [Code](greedy/846/main.go)|

|848 | Shifting Letters |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/shifting-letters/description/) | [Code](array/848/main.go)|

|849 | Maximize Distance to Closest Person |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximize-distance-to-closest-person/description/) | [Code](array/849/main.go)|

|853 | Car Fleet |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/car-fleet/description/) | [Code](monotonic_stack/853/main.go)|

|860 | Lemonade Change |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/lemonade-change/description/) | [Code](greedy/860/main.go)|

|863 | All Nodes Distance K in Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/description/) | [Code](btree/863/main.go)|

|865 | Smallest Subtree with all the Deepest Nodes |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/description/) | [Code](btree/865/main.go)|

|867 | Transpose Matrix |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/transpose-matrix/description/) | [Code](matrix/867/main.go)|

|874 | Walking Robot Simulation |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/walking-robot-simulation/description/) | [Code](hash_table/874/main.go)|

|875 | Koko Eating Bananas |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/koko-eating-bananas/description/) | [Code](binarysearch/875/main.go)|

|881 | Boats to Save People |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/boats-to-save-people/description/) | [Code](greedy/881/main.go)|

|884 | Uncommon Words from Two Sentences |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/uncommon-words-from-two-sentences/description/) | [Code](hash_table/884/main.go)|

|897 | Increasing Order Search Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/increasing-order-search-tree/description/) | [Code](btree/897/main.go)|

|900 | RLE Iterator |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/rle-iterator/description/) | [Code](design/900/main.go)|

|905 | Sort Array By Parity |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/sort-array-by-parity/description/) | [Code](array/905/main.go)|

|909 | Snakes and Ladders |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/snakes-and-ladders/description/) | [Code](matrix/909/main.go)|

|921 | Minimum Add to Make Parentheses Valid |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/description/) | [Code](greedy/921/main.go)|

|930 | Binary Subarrays With Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/binary-subarrays-with-sum/description/) | [Code](prefix_sum/930/main.go)|

|931 | Minimum Falling Path Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-falling-path-sum/description/) | [Code](dp/931/main.go)|

|935 | Knight Dialer |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/knight-dialer/description/) | [Code](dp/935/main.go)|

|938 | Range Sum of BST |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/range-sum-of-bst/description/) | [Code](btree/938/main.go)|

|941 | Valid Mountain Array |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/valid-mountain-array/description/) | [Code](array/941/main.go)|

|945 | Minimum Increment to Make Array Unique |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-increment-to-make-array-unique/description/) | [Code](array/945/main.go)|

|946 | Validate Stack Sequences |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/validate-stack-sequences/description/) | [Code](stack/946/main.go)|

|948 | Bag of Tokens |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/bag-of-tokens/description/) | [Code](greedy/948/main.go)|

|958 | Check Completeness of a Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/check-completeness-of-a-binary-tree/description/) | [Code](btree/958/main.go)|

|965 | Univalued Binary Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/univalued-binary-tree/description/) | [Code](btree/965/main.go)|

|967 | Numbers With Same Consecutive Differences |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/numbers-with-same-consecutive-differences/description/) | [Code](backtracking/967/main.go)|

|973 | K Closest Points to Origin |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/k-closest-points-to-origin/description/) | [Code](heap/973/main.go)|

|974 | Subarray Sums Divisible by K |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/subarray-sums-divisible-by-k/description/) | [Code](prefix_sum/974/main.go)|

|980 | Unique Paths III |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/unique-paths-iii/description/) | [Code](backtracking/980/main.go)|

|981 | Time Based Key-Value Store |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/time-based-key-value-store/description/) | [Code](design/981/main.go)|

|983 | Minimum Cost For Tickets |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-cost-for-tickets/description/) | [Code](dp/983/main.go)|

|987 | Vertical Order Traversal of a Binary Tree |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/description/) | [Code](btree/987/main.go)|

|988 | Smallest String Starting From Leaf |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/smallest-string-starting-from-leaf/description/) | [Code](btree/988/main.go)|

|993 | Cousins in Binary Tree |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/cousins-in-binary-tree/description/) | [Code](btree/993/main.go)|

|1002 | Find Common Characters |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/find-common-characters/description/) | [Code](hash_table/1002/main.go)|

|1008 | Construct Binary Search Tree from Preorder Traversal |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/description/) | [Code](btree/1008/main.go)|

|1010 | Pairs of Songs With Total Durations Divisible by 60 |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/description/) | [Code](array/1010/main.go)|

|1011 | Capacity To Ship Packages Within D Days |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/description/) | [Code](binarysearch/1011/main.go)|

|1020 | Number of Enclaves |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-enclaves/description/) | [Code](matrix/1020/main.go)|

|1038 | Binary Search Tree to Greater Sum Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/description/) | [Code](btree/1038/main.go)|

|1042 | Flower Planting With No Adjacent |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/flower-planting-with-no-adjacent/description/) | [Code](graph/1042/main.go)|

|1046 | Last Stone Weight |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/last-stone-weight/description/) | [Code](heap/1046/main.go)|

|1054 | Distant Barcodes |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/distant-barcodes/description/) | [Code](heap/1054/main.go)|

|1062 | Longest Repeating Substring |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-repeating-substring/description/) | [Code](string/1062/main.go)|

|1079 | Letter Tile Possibilities |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/letter-tile-possibilities/description/) | [Code](backtracking/1079/main.go)|

|1080 | Insufficient Nodes in Root to Leaf Paths |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/description/) | [Code](btree/1080/main.go)|

|1081 | Smallest Subsequence of Distinct Characters |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/description/) | [Code](greedy/1081/main.go)|

|1091 | Shortest Path in Binary Matrix |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/shortest-path-in-binary-matrix/description/) | [Code](matrix/1091/main.go)|

|1095 | Find in Mountain Array |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/find-in-mountain-array/description/) | [Code](binarysearch/1095/main.go)|

|1100 | Find K-Length Substrings With No Repeated Characters |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/description/) | [Code](sliding_window/1100/main.go)|

|1101 | The Earliest Moment When Everyone Become Friends |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/description/) | [Code](union_find/1101/main.go)|

|1110 | Delete Nodes And Return Forest |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/delete-nodes-and-return-forest/description/) | [Code](btree/1110/main.go)|

|1123 | Lowest Common Ancestor of Deepest Leaves |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/description/) | [Code](btree/1123/main.go)|

|1128 | Number of Equivalent Domino Pairs |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/number-of-equivalent-domino-pairs/description/) | [Code](hash_table/1128/main.go)|

|1135 | Connecting Cities With Minimum Cost |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/connecting-cities-with-minimum-cost/description/) | [Code](union_find/1135/main.go)|

|1136 | Parallel Courses |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/parallel-courses/description/) | [Code](graph/1136/main.go)|

|1146 | Snapshot Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/snapshot-array/description/) | [Code](design/1146/main.go)|

|1155 | Number of Dice Rolls With Target Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/description/) | [Code](dp/1155/main.go)|

|1162 | As Far from Land as Possible |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/as-far-from-land-as-possible/description/) | [Code](matrix/1162/main.go)|

|1167 | Minimum Cost to Connect Sticks |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-cost-to-connect-sticks/description/) | [Code](heap/1167/main.go)|

|1171 | Remove Zero Sum Consecutive Nodes from Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/description/) | [Code](linked_list/1171/main.go)|

|1190 | Reverse Substrings Between Each Pair of Parentheses |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/description/) | [Code](stack/1190/main.go)|

|1197 | Minimum Knight Moves |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-knight-moves/description/) | [Code](matrix/1197/main.go)|

|1198 | Find Smallest Common Element in All Rows |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/description/) | [Code](binarysearch/1198/main.go)|

|1200 | Minimum Absolute Difference |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/minimum-absolute-difference/description/) | [Code](array/1200/main.go)|

|1213 | Intersection of Three Sorted Arrays |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/intersection-of-three-sorted-arrays/description/) | [Code](hash_table/1213/main.go)|

|1214 | Two Sum BSTs |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/two-sum-bsts/description/) | [Code](binarysearch/1214/main.go)|

|1219 | Path with Maximum Gold |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/path-with-maximum-gold/description/) | [Code](backtracking/1219/main.go)|

|1221 | Split a String in Balanced Strings |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/split-a-string-in-balanced-strings/description/) | [Code](string/1221/main.go)|

|1222 | Queens That Can Attack the King |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/queens-that-can-attack-the-king/description/) | [Code](array/1222/main.go)|

|1233 | Remove Sub-Folders from the Filesystem |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/description/) | [Code](trie/1233/main.go)|

|1235 | Maximum Profit in Job Scheduling |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/maximum-profit-in-job-scheduling/description/) | [Code](dp/1235/main.go)|

|1239 | Maximum Length of a Concatenated String with Unique Characters |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/description/) | [Code](backtracking/1239/main.go)|

|1248 | Count Number of Nice Subarrays |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-number-of-nice-subarrays/description/) | [Code](sliding_window/1248/main.go)|

|1254 | Number of Closed Islands |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-closed-islands/description/) | [Code](matrix/1254/main.go)|

|1255 | Maximum Score Words Formed by Letters |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/maximum-score-words-formed-by-letters/description/) | [Code](backtracking/1255/main.go)|

|1258 | Synonymous Sentences |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/synonymous-sentences/description/) | [Code](backtracking/1258/main.go)|

|1265 | Print Immutable Linked List in Reverse |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/print-immutable-linked-list-in-reverse/description/) | [Code](linked_list/1265/main.go)|

|1267 | Count Servers that Communicate |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-servers-that-communicate/description/) | [Code](graph/1267/main.go)|

|1277 | Count Square Submatrices with All Ones |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-square-submatrices-with-all-ones/description/) | [Code](dp/1277/main.go)|

|1283 | Find the Smallest Divisor Given a Threshold |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/description/) | [Code](array/1283/main.go)|

|1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/description/) | [Code](backtracking/1284/main.go)|

|1286 | Iterator for Combination |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/iterator-for-combination/description/) | [Code](design/1286/main.go)|

|1289 | Minimum Falling Path Sum II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/minimum-falling-path-sum-ii/description/) | [Code](dp/1289/main.go)|

|1290 | Convert Binary Number in a Linked List to Integer |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/description/) | [Code](linked_list/1290/main.go)|

|1291 | Sequential Digits |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/sequential-digits/description/) | [Code](string/1291/main.go)|

|1293 | Shortest Path in a Grid with Obstacles Elimination |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/description/) | [Code](graph/1293/main.go)|

|1296 | Divide Array in Sets of K Consecutive Numbers |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/description/) | [Code](array/1296/main.go)|

|1302 | Deepest Leaves Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/deepest-leaves-sum/description/) | [Code](btree/1302/main.go)|

|1305 | All Elements in Two Binary Search Trees |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/description/) | [Code](btree/1305/main.go)|

|1306 | Jump Game III |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/jump-game-iii/description/) | [Code](array/1306/main.go)|

|1314 | Matrix Block Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/matrix-block-sum/description/) | [Code](prefix_sum/1314/main.go)|

|1315 | Sum of Nodes with Even-Valued Grandparent |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/description/) | [Code](btree/1315/main.go)|

|1324 | Print Words Vertically |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/print-words-vertically/description/) | [Code](array/1324/main.go)|

|1325 | Delete Leaves With a Given Value |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/delete-leaves-with-a-given-value/description/) | [Code](btree/1325/main.go)|

|1333 | Filter Restaurants by Vegan-Friendly, Price and Distance |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly,-price-and-distance/description/) | [Code](array/1333/main.go)|

|1337 | The K Weakest Rows in a Matrix |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/description/) | [Code](heap/1337/main.go)|

|1338 | Reduce Array Size to The Half |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reduce-array-size-to-the-half/description/) | [Code](heap/1338/main.go)|

|1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/description/) | [Code](array/1343/main.go)|

|1345 | Jump Game IV |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/jump-game-iv/description/) | [Code](array/1345/main.go)|

|1361 | Validate Binary Tree Nodes |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/validate-binary-tree-nodes/description/) | [Code](topological_sort/1361/main.go)|

|1367 | Linked List in Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/linked-list-in-binary-tree/description/) | [Code](btree/1367/main.go)|

|1372 | Longest ZigZag Path in a Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/description/) | [Code](btree/1372/main.go)|

|1380 | Lucky Numbers in a Matrix |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/lucky-numbers-in-a-matrix/description/) | [Code](matrix/1380/main.go)|

|1387 | Sort Integers by The Power Value |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/sort-integers-by-the-power-value/description/) | [Code](dp/1387/main.go)|

|1395 | Count Number of Teams |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-number-of-teams/description/) | [Code](array/1395/main.go)|

|1402 | Reducing Dishes |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/reducing-dishes/description/) | [Code](greedy/1402/main.go)|

|1405 | Longest Happy String |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-happy-string/description/) | [Code](greedy/1405/main.go)|

|1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/description/) | [Code](greedy/1414/main.go)|

|1415 | The k-th Lexicographical String of All Happy Strings of Length n |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/description/) | [Code](backtracking/1415/main.go)|

|1419 | Minimum Number of Frogs Croaking |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-number-of-frogs-croaking/description/) | [Code](string/1419/main.go)|

|1448 | Count Good Nodes in Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-good-nodes-in-binary-tree/description/) | [Code](btree/1448/main.go)|

|1457 | Pseudo-Palindromic Paths in a Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/description/) | [Code](btree/1457/main.go)|

|1466 | Reorder Routes to Make All Paths Lead to the City Zero |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/description/) | [Code](graph/1466/main.go)|

|1472 | Design Browser History |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-browser-history/description/) | [Code](design/1472/main.go)|

|1474 | Delete N Nodes After M Nodes of a Linked List |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/description/) | [Code](linked_list/1474/main.go)|

|1475 | Final Prices With a Special Discount in a Shop |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/description/) | [Code](monotonic_stack/1475/main.go)|

|1481 | Least Number of Unique Integers after K Removals |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/description/) | [Code](greedy/1481/main.go)|

|1487 | Making File Names Unique |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/making-file-names-unique/description/) | [Code](hash_table/1487/main.go)|

|1506 | Find Root of N-Ary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-root-of-n-ary-tree/description/) | [Code](btree/1506/main.go)|

|1508 | Range Sum of Sorted Subarray Sums |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/description/) | [Code](array/1508/main.go)|

|1509 | Minimum Difference Between Largest and Smallest Value in Three Moves |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/description/) | [Code](greedy/1509/main.go)|

|1514 | Path with Maximum Probability |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/path-with-maximum-probability/description/) | [Code](graph/1514/main.go)|

|1518 | Water Bottles |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/water-bottles/description/) | [Code](math/1518/main.go)|

|1525 | Number of Good Ways to Split a String |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/description/) | [Code](dp/1525/main.go)|

|1530 | Number of Good Leaf Nodes Pairs |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/description/) | [Code](btree/1530/main.go)|

|1535 | Find the Winner of an Array Game |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-the-winner-of-an-array-game/description/) | [Code](array/1535/main.go)|

|1544 | Make The String Great |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/make-the-string-great/description/) | [Code](stack/1544/main.go)|

|1550 | Three Consecutive Odds |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/three-consecutive-odds/description/) | [Code](array/1550/main.go)|

|1551 | Minimum Operations to Make Array Equal |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-operations-to-make-array-equal/description/) | [Code](math/1551/main.go)|

|1557 | Minimum Number of Vertices to Reach All Nodes |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/description/) | [Code](graph/1557/main.go)|

|1561 | Maximum Number of Coins You Can Get |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/description/) | [Code](greedy/1561/main.go)|

|1570 | Dot Product of Two Sparse Vectors |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/description/) | [Code](array/1570/main.go)|

|1575 | Count All Possible Routes |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/count-all-possible-routes/description/) | [Code](dp/1575/main.go)|

|1578 | Minimum Time to Make Rope Colorful |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-time-to-make-rope-colorful/description/) | [Code](greedy/1578/main.go)|

|1584 | Min Cost to Connect All Points |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/min-cost-to-connect-all-points/description/) | [Code](union_find/1584/main.go)|

|1593 | Split a String Into the Max Number of Unique Substrings |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings/description/) | [Code](backtracking/1593/main.go)|

|1598 | Crawler Log Folder |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/crawler-log-folder/description/) | [Code](stack/1598/main.go)|

|1608 | Special Array With X Elements Greater Than or Equal X |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/description/) | [Code](array/1608/main.go)|

|1609 | Even Odd Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/even-odd-tree/description/) | [Code](btree/1609/main.go)|

|1630 | Arithmetic Subarrays |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/arithmetic-subarrays/description/) | [Code](array/1630/main.go)|

|1636 | Sort Array by Increasing Frequency |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/sort-array-by-increasing-frequency/description/) | [Code](hash_table/1636/main.go)|

|1641 | Count Sorted Vowel Strings |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-sorted-vowel-strings/description/) | [Code](dp/1641/main.go)|

|1647 | Minimum Deletions to Make Character Frequencies Unique |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/description/) | [Code](greedy/1647/main.go)|

|1650 | Lowest Common Ancestor of a Binary Tree III |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/description/) | [Code](btree/1650/main.go)|

|1652 | Defuse the Bomb |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/defuse-the-bomb/description/) | [Code](array/1652/main.go)|

|1653 | Minimum Deletions to Make String Balanced |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/description/) | [Code](stack/1653/main.go)|

|1657 | Determine if Two Strings Are Close |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/determine-if-two-strings-are-close/description/) | [Code](hash_table/1657/main.go)|

|1670 | Design Front Middle Back Queue |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-front-middle-back-queue/description/) | [Code](design/1670/main.go)|

|1706 | Where Will the Ball Fall |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/where-will-the-ball-fall/description/) | [Code](dp/1706/main.go)|

|1721 | Swapping Nodes in a Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/description/) | [Code](linked_list/1721/main.go)|

|1740 | Find Distance in a Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-distance-in-a-binary-tree/description/) | [Code](btree/1740/main.go)|

|1756 | Design Most Recently Used Queue |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-most-recently-used-queue/description/) | [Code](design/1756/main.go)|

|1762 | Buildings With an Ocean View |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/buildings-with-an-ocean-view/description/) | [Code](monotonic_stack/1762/main.go)|

|1769 | Minimum Number of Operations to Move All Balls to Each Box |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/description/) | [Code](prefix_sum/1769/main.go)|

|1770 | Maximum Score from Performing Multiplication Operations |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations/description/) | [Code](dp/1770/main.go)|

|1797 | Design Authentication Manager |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-authentication-manager/description/) | [Code](design/1797/main.go)|

|1800 | Maximum Ascending Subarray Sum |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/maximum-ascending-subarray-sum/description/) | [Code](array/1800/main.go)|

|1823 | Find the Winner of the Circular Game |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-the-winner-of-the-circular-game/description/) | [Code](array/1823/main.go)|

|1836 | Remove Duplicates From an Unsorted Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/description/) | [Code](linked_list/1836/main.go)|

|1839 | Longest Substring Of All Vowels in Order |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-substring-of-all-vowels-in-order/description/) | [Code](sliding_window/1839/main.go)|

|1852 | Distinct Numbers in Each Subarray |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/distinct-numbers-in-each-subarray/description/) | [Code](sliding_window/1852/main.go)|

|1863 | Sum of All Subset XOR Totals |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/sum-of-all-subset-xor-totals/description/) | [Code](backtracking/1863/main.go)|

|1877 | Minimize Maximum Pair Sum in Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/description/) | [Code](greedy/1877/main.go)|

|1880 | Check if Word Equals Summation of Two Words |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/description/) | [Code](string/1880/main.go)|

|1894 | Find the Student that Will Replace the Chalk |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/description/) | [Code](array/1894/main.go)|

|1905 | Count Sub Islands |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-sub-islands/description/) | [Code](matrix/1905/main.go)|

|1910 | Remove All Occurrences of a Substring |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/description/) | [Code](string/1910/main.go)|

|1935 | Maximum Number of Words You Can Type |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/maximum-number-of-words-you-can-type/description/) | [Code](hash_table/1935/main.go)|

|1940 | Longest Common Subsequence Between Sorted Arrays |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays/description/) | [Code](array/1940/main.go)|

|1944 | Number of Visible People in a Queue |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/number-of-visible-people-in-a-queue/description/) | [Code](monotonic_stack/1944/main.go)|

|1945 | Sum of Digits of String After Convert |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/description/) | [Code](string/1945/main.go)|

|1947 | Maximum Compatibility Score Sum |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-compatibility-score-sum/description/) | [Code](backtracking/1947/main.go)|

|1957 | Delete Characters to Make Fancy String |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/delete-characters-to-make-fancy-string/description/) | [Code](string/1957/main.go)|

|1962 | Remove Stones to Minimize the Total |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/remove-stones-to-minimize-the-total/description/) | [Code](heap/1962/main.go)|

|1971 | Find if Path Exists in Graph |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/find-if-path-exists-in-graph/description/) | [Code](union_find/1971/main.go)|

|1973 | Count Nodes Equal to Sum of Descendants |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants/description/) | [Code](btree/1973/main.go)|

|1980 | Find Unique Binary String |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-unique-binary-string/description/) | [Code](backtracking/1980/main.go)|

|2016 | Maximum Difference Between Increasing Elements |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/maximum-difference-between-increasing-elements/description/) | [Code](dp/2016/main.go)|

|2024 | Maximize the Confusion of an Exam |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/description/) | [Code](sliding_window/2024/main.go)|

|2028 | Find Missing Observations |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-missing-observations/description/) | [Code](math/2028/main.go)|

|2044 | Count Number of Maximum Bitwise-OR Subsets |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/description/) | [Code](bit_manipulation/2044/main.go)|

|2046 | Sort Linked List Already Sorted Using Absolute Values |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values/description/) | [Code](linked_list/2046/main.go)|

|2050 | Parallel Courses III |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/parallel-courses-iii/description/) | [Code](topological_sort/2050/main.go)|

|2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/description/) | [Code](linked_list/2058/main.go)|

|2083 | Substrings That Begin and End With the Same Letter |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter/description/) | [Code](hash_table/2083/main.go)|

|2090 | K Radius Subarray Averages |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/k-radius-subarray-averages/description/) | [Code](array/2090/main.go)|

|2096 | Step-By-Step Directions From a Binary Tree Node to Another |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/description/) | [Code](btree/2096/main.go)|

|2115 | Find All Possible Recipes from Given Supplies |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/description/) | [Code](topological_sort/2115/main.go)|

|2125 | Number of Laser Beams in a Bank |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/description/) | [Code](array/2125/main.go)|

|2129 | Capitalize the Title |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/capitalize-the-title/description/) | [Code](string/2129/main.go)|

|2150 | Find All Lonely Numbers in the Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/description/) | [Code](hash_table/2150/main.go)|

|2177 | Find Three Consecutive Integers That Sum to a Given Number |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/description/) | [Code](math/2177/main.go)|

|2181 | Merge Nodes in Between Zeros |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/merge-nodes-in-between-zeros/description/) | [Code](linked_list/2181/main.go)|

|2186 | Minimum Number of Steps to Make Two Strings Anagram II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/description/) | [Code](array/2186/main.go)|

|2192 | All Ancestors of a Node in a Directed Acyclic Graph |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/description/) | [Code](topological_sort/2192/main.go)|

|2196 | Create Binary Tree From Descriptions |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/create-binary-tree-from-descriptions/description/) | [Code](btree/2196/main.go)|

|2204 | Distance to a Cycle in Undirected Graph |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/distance-to-a-cycle-in-undirected-graph/description/) | [Code](graph/2204/main.go)|

|2241 | Design an ATM Machine |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/design-an-atm-machine/description/) | [Code](design/2241/main.go)|

|2260 | Minimum Consecutive Cards to Pick Up |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/description/) | [Code](array/2260/main.go)|

|2261 | K Divisible Elements Subarrays |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/k-divisible-elements-subarrays/description/) | [Code](hash_table/2261/main.go)|

|2265 | Count Nodes Equal to Average of Subtree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/description/) | [Code](btree/2265/main.go)|

|2273 | Find Resultant Array After Removing Anagrams |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/description/) | [Code](hash_table/2273/main.go)|

|2289 | Steps to Make Array Non-decreasing |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/steps-to-make-array-non-decreasing/description/) | [Code](monotonic_stack/2289/main.go)|

|2290 | Minimum Obstacle Removal to Reach Corner |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/description/) | [Code](graph/2290/main.go)|

|2295 | Replace Elements in an Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/replace-elements-in-an-array/description/) | [Code](hash_table/2295/main.go)|

|2300 | Successful Pairs of Spells and Potions |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/successful-pairs-of-spells-and-potions/description/) | [Code](binarysearch/2300/main.go)|

|2302 | Count Subarrays With Score Less Than K |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/count-subarrays-with-score-less-than-k/description/) | [Code](sliding_window/2302/main.go)|

|2304 | Minimum Path Cost in a Grid |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-path-cost-in-a-grid/description/) | [Code](dp/2304/main.go)|

|2316 | Count Unreachable Pairs of Nodes in an Undirected Graph |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/description/) | [Code](union_find/2316/main.go)|

|2326 | Spiral Matrix IV |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/spiral-matrix-iv/description/) | [Code](linked_list/2326/main.go)|

|2328 | Number of Increasing Paths in a Grid |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/number-of-increasing-paths-in-a-grid/description/) | [Code](graph/2328/main.go)|

|2340 | Minimum Adjacent Swaps to Make a Valid Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array/description/) | [Code](greedy/2340/main.go)|

|2342 | Max Sum of a Pair With Equal Sum of Digits |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/description/) | [Code](heap/2342/main.go)|

|2360 | Longest Cycle in a Graph |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/longest-cycle-in-a-graph/description/) | [Code](graph/2360/main.go)|

|2361 | Minimum Costs Using the Train Line |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/minimum-costs-using-the-train-line/description/) | [Code](dp/2361/main.go)|

|2365 | Task Scheduler II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/task-scheduler-ii/description/) | [Code](array/2365/main.go)|

|2368 | Reachable Nodes With Restrictions |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reachable-nodes-with-restrictions/description/) | [Code](graph/2368/main.go)|

|2387 | Median of a Row Wise Sorted Matrix |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix/description/) | [Code](matrix/2387/main.go)|

|2393 | Count Strictly Increasing Subarrays |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-strictly-increasing-subarrays/description/) | [Code](array/2393/main.go)|

|2410 | Maximum Matching of Players With Trainers |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-matching-of-players-with-trainers/description/) | [Code](greedy/2410/main.go)|

|2415 | Reverse Odd Levels of Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/description/) | [Code](btree/2415/main.go)|

|2419 | Longest Subarray With Maximum Bitwise AND |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/description/) | [Code](bit_manipulation/2419/main.go)|

|2422 | Merge Operations to Turn Array Into a Palindrome |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/merge-operations-to-turn-array-into-a-palindrome/description/) | [Code](greedy/2422/main.go)|

|2435 | Paths in Matrix Whose Sum Is Divisible by K |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/description/) | [Code](dp/2435/main.go)|

|2462 | Total Cost to Hire K Workers |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/total-cost-to-hire-k-workers/description/) | [Code](heap/2462/main.go)|

|2477 | Minimum Fuel Cost to Report to the Capital |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-fuel-cost-to-report-to-the-capital/description/) | [Code](graph/2477/main.go)|

|2486 | Append Characters to String to Make Subsequence |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/append-characters-to-string-to-make-subsequence/description/) | [Code](greedy/2486/main.go)|

|2487 | Remove Nodes From Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/remove-nodes-from-linked-list/description/) | [Code](monotonic_stack/2487/main.go)|

|2491 | Divide Players Into Teams of Equal Skill |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/divide-players-into-teams-of-equal-skill/description/) | [Code](array/2491/main.go)|

|2506 | Count Pairs Of Similar Strings |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/count-pairs-of-similar-strings/description/) | [Code](hash_table/2506/main.go)|

|2510 | Check if There is a Path With Equal Number of 0's And 1's |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/check-if-there-is-a-path-with-equal-number-of-0's-and-1's/description/) | [Code](dp/2510/main.go)|

|2512 | Reward Top K Students |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/reward-top-k-students/description/) | [Code](heap/2512/main.go)|

|2536 | Increment Submatrices by One |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/increment-submatrices-by-one/description/) | [Code](matrix/2536/main.go)|

|2559 | Count Vowel Strings in Ranges |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-vowel-strings-in-ranges/description/) | [Code](prefix_sum/2559/main.go)|

|2563 | Count the Number of Fair Pairs |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-the-number-of-fair-pairs/description/) | [Code](binarysearch/2563/main.go)|

|2583 | Kth Largest Sum in a Binary Tree |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/description/) | [Code](btree/2583/main.go)|

|2592 | Maximize Greatness of an Array |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximize-greatness-of-an-array/description/) | [Code](greedy/2592/main.go)|

|2593 | Find Score of an Array After Marking All Elements |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements/description/) | [Code](heap/2593/main.go)|

|2599 | Make the Prefix Sum Non-negative |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/make-the-prefix-sum-non-negative/description/) | [Code](heap/2599/main.go)|

|2642 | Design Graph With Shortest Path Calculator |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/design-graph-with-shortest-path-calculator/description/) | [Code](graph/2642/main.go)|

|2670 | Find the Distinct Difference Array |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/find-the-distinct-difference-array/description/) | [Code](hash_table/2670/main.go)|

|2671 | Frequency Tracker |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/frequency-tracker/description/) | [Code](design/2671/main.go)|

|2679 | Sum in a Matrix |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/sum-in-a-matrix/description/) | [Code](heap/2679/main.go)|

|2707 | Extra Characters in a String |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/extra-characters-in-a-string/description/) | [Code](dp/2707/main.go)|

|2710 | Remove Trailing Zeros From a String |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/remove-trailing-zeros-from-a-string/description/) | [Code](string/2710/main.go)|

|2743 | Count Substrings Without Repeating Character |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-substrings-without-repeating-character/description/) | [Code](sliding_window/2743/main.go)|

|2788 | Split Strings by Separator |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/split-strings-by-separator/description/) | [Code](string/2788/main.go)|

|2792 | Count Nodes That Are Great Enough |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/count-nodes-that-are-great-enough/description/) | [Code](btree/2792/main.go)|

|2807 | Insert Greatest Common Divisors in Linked List |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/description/) | [Code](linked_list/2807/main.go)|

|2838 | Maximum Coins Heroes Can Collect |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-coins-heroes-can-collect/description/) | [Code](binarysearch/2838/main.go)|

|2852 | Sum of Remoteness of All Cells |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/sum-of-remoteness-of-all-cells/description/) | [Code](union_find/2852/main.go)|

|2924 | Find Champion II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-champion-ii/description/) | [Code](graph/2924/main.go)|

|2938 | Separate Black and White Balls |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/separate-black-and-white-balls/description/) | [Code](greedy/2938/main.go)|

|2950 | Number of Divisible Substrings |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-divisible-substrings/description/) | [Code](hash_table/2950/main.go)|

|2974 | Minimum Number Game |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/minimum-number-game/description/) | [Code](heap/2974/main.go)|

|2992 | Number of Self-Divisible Permutations |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/number-of-self-divisible-permutations/description/) | [Code](backtracking/2992/main.go)|

|3004 | Maximum Subtree of the Same Color |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-subtree-of-the-same-color/description/) | [Code](graph/3004/main.go)|

|3016 | Minimum Number of Pushes to Type Word II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii/description/) | [Code](greedy/3016/main.go)|

|3028 | Ant on the Boundary |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/ant-on-the-boundary/description/) | [Code](prefix_sum/3028/main.go)|

|3032 | Count Numbers With Unique Digits II |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/count-numbers-with-unique-digits-ii/description/) | [Code](dp/3032/main.go)|

|3037 | Find Pattern in Infinite Stream II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/find-pattern-in-infinite-stream-ii/description/) | [Code](string/3037/main.go)|

|3043 | Find the Length of the Longest Common Prefix |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix/description/) | [Code](hash_table/3043/main.go)|

|3063 | Linked List Frequency |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/linked-list-frequency/description/) | [Code](linked_list/3063/main.go)|

|3090 | Maximum Length Substring With Two Occurrences |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/maximum-length-substring-with-two-occurrences/description/) | [Code](sliding_window/3090/main.go)|

|3105 | Longest Strictly Increasing or Strictly Decreasing Subarray |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/description/) | [Code](monotonic_stack/3105/main.go)|

|3110 | Score of a String |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/score-of-a-string/description/) | [Code](string/3110/main.go)|

|3121 | Count the Number of Special Characters II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-the-number-of-special-characters-ii/description/) | [Code](hash_table/3121/main.go)|

|3131 | Find the Integer Added to Array I |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/find-the-integer-added-to-array-i/description/) | [Code](array/3131/main.go)|

|3163 | String Compression III |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/string-compression-iii/description/) | [Code](string/3163/main.go)|

|3170 | Lexicographically Minimum String After Removing Stars |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/lexicographically-minimum-string-after-removing-stars/description/) | [Code](heap/3170/main.go)|

|3180 | Maximum Total Reward Using Operations I |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-total-reward-using-operations-i/description/) | [Code](dp/3180/main.go)|

|3205 | Maximum Array Hopping Score I |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/maximum-array-hopping-score-i/description/) | [Code](dp/3205/main.go)|

|3233 | Find the Count of Numbers Which Are Not Special |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special/description/) | [Code](math/3233/main.go)|

|3248 | Snake in Matrix |$\color{green}{\textsf{Easy}}$ | [Link](https://leetcode.com/problems/snake-in-matrix/description/) | [Code](matrix/3248/main.go)|

|3249 | Count the Number of Good Nodes |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-the-number-of-good-nodes/description/) | [Code](btree/3249/main.go)|

|3250 | Find the Count of Monotonic Pairs I |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/find-the-count-of-monotonic-pairs-i/description/) | [Code](dp/3250/main.go)|

|3297 | Count Substrings That Can Be Rearranged to Contain a String I |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/description/) | [Code](sliding_window/3297/main.go)|

|3298 | Count Substrings That Can Be Rearranged to Contain a String II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii/description/) | [Code](sliding_window/3298/main.go)|

|3329 | Count Substrings With K-Frequency Characters II |$\color{red}{\textsf{Hard}}$ | [Link](https://leetcode.com/problems/count-substrings-with-k-frequency-characters-ii/description/) | [Code](sliding_window/3329/main.go)|

|3341 | Find Minimum Time to Reach Last Room I |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-i/description/) | [Code](matrix/3341/main.go)|

|3342 | Find Minimum Time to Reach Last Room II |$\color{orange}{\textsf{Medium}}$ | [Link](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/description/) | [Code](graph/3342/main.go)|
ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Awesome

https://github.com/mrbelka12000/leetcode_training

Awesome Lists containing this project

README
