Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/fspv/learning
Leetcode solutions, contests and some other algorithm-related stuff
https://github.com/fspv/learning
algorithm contest-solution golang leetcode leetcode-python leetcode-solutions python
Last synced: about 2 months ago
JSON representation
Leetcode solutions, contests and some other algorithm-related stuff
- Host: GitHub
- URL: https://github.com/fspv/learning
- Owner: fspv
- Created: 2016-12-03T13:43:49.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2024-01-05T08:48:41.000Z (9 months ago)
- Last Synced: 2024-06-30T09:18:59.932Z (3 months ago)
- Topics: algorithm, contest-solution, golang, leetcode, leetcode-python, leetcode-solutions, python
- Language: Python
- Homepage:
- Size: 2.34 MB
- Stars: 67
- Watchers: 3
- Forks: 17
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Grind tracking
This is the repo where I store every solved problem I encountered during my CS learning process.
It has hundreds of solved leetcode tasks as well as tasks from some online competitions. You'll find the list below. Also there are some implemented algorithms from CLRS.
## AdventOfCode
Task | Solution
-----|---------
[2021 Day 1](https://adventofcode.com/2021/day/1) | [Part 1 Python](/adventofcode/2021/1_1.py) [Part 2 Python](/adventofcode/2021/1_2.py)
[2022 Day 1](https://adventofcode.com/2022/day/1) | [Part 1 Golang](/adventofcode/2022/day01_1.go) [Part 2 Golang](/adventofcode/2022/day01_2.go)
[2022 Day 2](https://adventofcode.com/2022/day/2) | [Part 1 Golang](/adventofcode/2022/day02_1.go) [Part 2 Golang](/adventofcode/2022/day02_2.go)
[2022 Day 4](https://adventofcode.com/2022/day/4) | [Python](/adventofcode/2022/day04.py)
[2022 Day 5](https://adventofcode.com/2022/day/5) | [Python](/adventofcode/2022/day05.py)
[2022 Day 6](https://adventofcode.com/2022/day/6) | [Golang](/adventofcode/2022/day06.go)
[2022 Day 7](https://adventofcode.com/2022/day/7) | [Golang](/adventofcode/2022/day07.go)
[2022 Day 8](https://adventofcode.com/2022/day/8) | [Golang](/adventofcode/2022/day08.go)
## BinarySearch
Task | Solution
-----|---------
[Nearest Bus Stop From a House](https://binarysearch.com/problems/Nearest-Bus-Stop-From-a-House) | [Python](/binarysearch.com/Nearest-Bus-Stop-From-a-House.py)
[Non-Adjacent Combination Sum](https://binarysearch.com/problems/Non-Adjacent-Combination-Sum) | [Python](/binarysearch.com/Non-Adjacent-Combination-Sum.py)
[Sublist with Largest Min-Length Product](https://binarysearch.com/problems/Sublist-with-Largest-Min-Length-Product) | [Python](/binarysearch.com/Sublist-with-Largest-Min-Length-Product.py)
[Smallest Number With No Adjacent Duplicates](https://binarysearch.com/problems/Smallest-Number-With-No-Adjacent-Duplicates) | [Python](/binarysearch.com/Smallest-Number-With-No-Adjacent-Duplicates.py)
## Google Codejam
Task | Solution
-----|---------
[Qualification Round 2020: Vestigium](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd27/000000000020993c) | [Python](/codejam/2020-04-04/Vestigium/)
[Qualification Round 2020: Nesting Depth](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd27/0000000000209a9f) | [Python](/codejam/2020-04-04/Nesting_Depth/)
[Qualification Round 2020: Parenting Partnering Returns](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd27/000000000020bdf9) | [Python](/codejam/2020-04-04/Parenting_Partnering_Returns/)
[Qualification Round 2020: ESAb ATAd](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd27/0000000000209a9e) | [Python](/codejam/2020-04-04/ESAb_ATAd/)
[Qualification Round 2020: Indicium](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd27/0000000000209aa0) | [Python](/codejam/2020-04-04/Indicium/)
[Round 1B: 2020: Expogo](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fef2/00000000002d5b62) | [Python](/codejam/2020-04-19/Expogo/)
[Qualification Round 2020: Punched Cards](https://codingcompetitions.withgoogle.com/codejam/round/0000000000876ff1/0000000000a4621b) | [Python](/codejam/2022-04-02/Punched_Cards)
## Facebook Hacker Cup
Task | Solution
-----|---------
[Qualification Round 2020: Travel Restrictions](https://www.facebook.com/codingcompetitions/hacker-cup/2020/qualification-round/problems/A) | [Python](/hacker-cup/2020/qualification_round/A/)
[Qualification Round 2020: Alchemy](https://www.facebook.com/codingcompetitions/hacker-cup/2020/qualification-round/problems/B) | [Python](/hacker-cup/2020/qualification_round/B/)
[Qualification Round 2020: Timber](https://www.facebook.com/codingcompetitions/hacker-cup/2020/qualification-round/problems/C) | [Python](/hacker-cup/2020/qualification_round/C/)
[Qualification Round 2020: Running on Fumes - Chapter 1](https://www.facebook.com/codingcompetitions/hacker-cup/2020/qualification-round/problems/D1) | [Python](/hacker-cup/2020/qualification_round/D1/)
[Qualification Round 2020: Running on Fumes - Chapter 2](https://www.facebook.com/codingcompetitions/hacker-cup/2020/qualification-round/problems/D2) | [Python](/hacker-cup/2020/qualification_round/D2/)
## CLRS
* [Binary search](/cormen-introduction/binary-search.py)
* [Binary tree](/cormen-introduction/binary_tree.py)
* [Deque](/cormen-introduction/deque.py)
* [Heap](/cormen-introduction/heap.py)
* [KMP algorithm](/cormen-introduction/kmp.py)
* [Linear search](/cormen-introduction/linear-search.py)
* [Linked List](/cormen-introduction/linked_list.py)
* [Merge Sort](/cormen-introduction/merge-sort.py)
* [Object array representation](/cormen-introduction/object_array_representation.py)
* [Helper to print binary tree](/cormen-introduction/print_binary_tree.py)
* [Queue](/cormen-introduction/deque.py)
* [Two stacks queue](/cormen-introduction/queue-two-stacks.py)
* [Really simple sort](/cormen-introduction/really-simple-sort.py)
* [Selection sort](/cormen-introduction/selection-sort.py)
* [Stack](/cormen-introduction/stack.py)
* [Two queues stack](/cormen-introduction/stack-two-queue.py)
* [Tree](/cormen-introduction/tree.py)
* [22.1-3](/cormen-introduction/22.1-3.py)
* [32.3-1](/cormen-introduction/32_3-1.py)
## Pramp
* [Array index and element equality](/pramp/array-index-and-element-equality.py)
* [Array of array products](/pramp/array-of-array-products.py)
* [Busiest time in the mall](/pramp/busiest-time-in-the-mall.py)
* [Largest smaller BST key](/pramp/largest-smaller-bst-key.py)
## Hackerrank
Task | Solution
-----|---------
[2D Array - DS](https://www.hackerrank.com/challenges/2d-array/problem) | [Python](/hackerrank/2d-array.py)
[Climbing the Leaderboard](https://www.hackerrank.com/challenges/climbing-the-leaderboard/problem) | [Python](/hackerrank/climbing-the-leaderboard.py)
[Counting Valleys](https://www.hackerrank.com/challenges/counting-valleys/problem) | [Python](/hackerrank/counting-valleys.py)
[Arrays: Left Rotation](https://www.hackerrank.com/challenges/ctci-array-left-rotation/problem) | [Python](/hackerrank/ctci-array-left-rotation.py)
[Sorting: Bubble Sort](https://www.hackerrank.com/challenges/ctci-bubble-sort/problem) | [Python](/hackerrank/ctci-bubble-sort.py)
Merge Sort | [Python](/hackerrank/ctci-merge-sort.py)
[Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem) | [Python](/hackerrank/jumping-on-the-clouds.py)
[Forming a Magic Square](https://www.hackerrank.com/challenges/magic-square-forming/problem) | [Python](/hackerrank/magic-square-forming.py)
[Repeated String](https://www.hackerrank.com/challenges/repeated-string/problem) | [Python](/hackerrank/repeated-string.py)
[Sales by Match](https://www.hackerrank.com/challenges/sock-merchant/problem) | [Python](/hackerrank/sock-merchant.py)
## C++ (Yandex course on coursera)
* [Week 1](/c-plus-plus-white/week1/)
* [Week 2](/c-plus-plus-white/week2/)
## Desing patterns
* [Decorator](/design_patterns/decorator.py)
* [Observer](/design_patterns/observer.py)
## Yandex mentor qualification competition
[Отборочное задание для наставников курса "Алгоритмы для разработчиков"](https://contest.yandex.ru/contest/25397/enter/)
Task | Solution
-----|---------
[A. Палиндромная конкатенация](https://contest.yandex.ru/contest/25397/problems/A/) | [Python](/yandex/qualification-for-mentors/palindrome-concatenation.py) [Golang](/yandex/qualification-for-mentors/palindrome-concatenation.go)
[B. Расстановка скобок](https://contest.yandex.ru/contest/25397/problems/B/) | [Python](/yandex/qualification-for-mentors/matrix-multiplication.py) [Golang](/yandex/qualification-for-mentors/matrix-multiplication.go)
[C. Путь по компонентам](https://contest.yandex.ru/contest/25397/problems/C/) | [Python](/yandex/qualification-for-mentors/component-path.py) [Golang](/yandex/qualification-for-mentors/component-path.go)
## Codeforces
Task | Solution
-----|---------
[103715: A](https://codeforces.com/gym/103715/problem/A) | [Python](/codeforces/103715/A.py)
[103715: B](https://codeforces.com/gym/103715/problem/B) | [Python](/codeforces/103715/B.py)
[103715: C](https://codeforces.com/gym/103715/problem/C) | [Python](/codeforces/103715/C.py)
[103715: D](https://codeforces.com/gym/103715/problem/D) | [Python](/codeforces/103715/D.py)
## Presentations (drafts)
* [Quicksort](/presentations/faang_learning_group/quicksort/)
## Leetcode
Task | Solution
-----|---------
[Reorganize String](https://leetcode.com/problems/reorganize-string/) | [Python](/l33tcode/reorganize-string.py) [Golang](/l33tcode/reorganize-string.go)
[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/) | [Python](/l33tcode/sequence-reconstruction.py)
[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/) | [Python](/l33tcode/reduce-array-size-to-the-half.py)
[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/) | [Python](/l33tcode/maximum-repeating-substring.py)
[Distribute Repeating Integers](https://leetcode.com/problems/distribute-repeating-integers/) | [Python](/l33tcode/distribute-repeating-integers.py)
[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [Python](/l33tcode/best-time-to-buy-and-sell-stock-with-cooldown.py)
[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | [Python](/l33tcode/pairs-of-songs-with-total-durations-divisible-by-60.py)
[4Sum II](https://leetcode.com/problems/4sum-ii/) | [Python](/l33tcode/4sum-ii.py)
[Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/) | [Python](/l33tcode/partition-array-for-maximum-sum.py)
[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/) | [Python](/l33tcode/k-th-symbol-in-grammar.py)
[Detect Capital](https://leetcode.com/problems/detect-capital/) | [Python](/l33tcode/detect-capital.py)
[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/) | [Python](/l33tcode/3sum-with-multiplicity.py)
[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | [Python](/l33tcode/insert-delete-getrandom-o1-duplicates-allowed.py)
[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/) | [Python](/l33tcode/construct-k-palindrome-strings.py)
[Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/) | [Python](/l33tcode/mean-of-array-after-removing-some-elements.py)
[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/) | [Python](/l33tcode/verifying-an-alien-dictionary.py)
[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/) | [Python](/l33tcode/add-bold-tag-in-string.py)
[Counting Bits](https://leetcode.com/problems/counting-bits/) | [Python](/l33tcode/counting-bits.py)
[Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/) | [Golang](/l33tcode/rabbits-in-forest.go)
[Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2/) | [Python](/l33tcode/reordered-power-of-2.py)
[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/) | [Python](/l33tcode/vowel-spellchecker.py)
[Count and Say](https://leetcode.com/problems/count-and-say/) | [Python](/l33tcode/count-and-say.py)
[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/) | [Python](/l33tcode/occurrences-after-bigram.py)
[Evaluate Division](https://leetcode.com/problems/evaluate-division/) | [Python](/l33tcode/evaluate-division.py)
[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/) | [Python](/l33tcode/element-appearing-more-than-25-in-sorted-array.py)
[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | [Python](/l33tcode/number-of-recent-calls.py)
[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | [Python](/l33tcode/largest-divisible-subset.py)
[Number of Sets of K Non-Overlapping Line Segments](https://leetcode.com/problems/number-of-sets-of-k-non-overlapping-line-segments/) | [Python](/l33tcode/number-of-sets-of-k-non-overlapping-line-segments.py)
[Candy](https://leetcode.com/problems/candy/) | [Python](/l33tcode/candy.py)
[Contiguous Array](https://leetcode.com/problems/contiguous-array/) | [Python](/l33tcode/contiguous-array.py)
[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | [Python](/l33tcode/remove-linked-list-elements.py)
[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | [Python](/l33tcode/search-in-rotated-sorted-array-ii.py) [Golang](/l33tcode/search-in-rotated-sorted-array-ii.go)
[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](/l33tcode/best-time-to-buy-and-sell-stock-ii.py)
[The Most Similar Path in a Graph](https://leetcode.com/problems/the-most-similar-path-in-a-graph/) | [Python](/l33tcode/the-most-similar-path-in-a-graph.py)
[Stone Game](https://leetcode.com/problems/stone-game/) | [Python](/l33tcode/stone-game.py)
[Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | [Python](/l33tcode/cheapest-flights-within-k-stops.py)
[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/) | [Python](/l33tcode/maximum-product-of-splitted-binary-tree.py)
[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [Python](/l33tcode/remove-nth-node-from-end-of-list.py)
[Longest Arithmetic Subsequence](https://leetcode.com/problems/longest-arithmetic-subsequence/) | [Python](/l33tcode/longest-arithmetic-subsequence.py)
[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/) | [Python](/l33tcode/longest-palindromic-subsequence.py)
[Tiling a Rectangle with the Fewest Squares](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/) | [Python](/l33tcode/tiling-a-rectangle-with-the-fewest-squares.py)
[Minimum Cost Tree From Leaf Values](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/) | [Python](/l33tcode/minimum-cost-tree-from-leaf-values.py)
[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](/l33tcode/number-of-connected-components-in-an-undirected-graph.py) [Golang](/l33tcode/number-of-connected-components-in-an-undirected-graph.go)
[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | [Python](/l33tcode/sliding-window-maximum.py)
[Dota2 Senate](https://leetcode.com/problems/dota2-senate/) | [Python](/l33tcode/dota2-senate.py)
[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/) | [Python](/l33tcode/count-of-range-sum.py)
[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/) | [Python](/l33tcode/letter-tile-possibilities.py)
[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | [Python](/l33tcode/reconstruct-itinerary.py)
[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | [Python](/l33tcode/maximum-length-of-repeated-subarray.py)
[Sequential Digits](https://leetcode.com/problems/sequential-digits/) | [Python](/l33tcode/sequential-digits.py)
[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) | [Python](/l33tcode/nested-list-weight-sum.py)
[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/) | [Python](/l33tcode/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.py)
[Online Stock Span](https://leetcode.com/problems/online-stock-span/) | [Python](/l33tcode/online-stock-span.py) [Golang](/l33tcode/online-stock-span.go)
[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | [Python](/l33tcode/minimum-depth-of-binary-tree.py)
[Strong Password Checker](https://leetcode.com/problems/strong-password-checker/) | [Python](/l33tcode/strong-password-checker.py)
[Number Complement](https://leetcode.com/problems/number-complement/) | [Golang](/l33tcode/number-complement.go)
[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/) | [Python](/l33tcode/palindrome-partitioning-ii.py)
[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) | [Python](/l33tcode/contains-duplicate-iii.py)
[3Sum](https://leetcode.com/problems/3sum/) | [Python](/l33tcode/3sum.py)
[Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/) | [Python](/l33tcode/maximize-distance-to-closest-person.py)
[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | [Python](/l33tcode/binary-search-tree-iterator.py)
[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | [Python](/l33tcode/reverse-words-in-a-string.py)
[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/) | [Python](/l33tcode/minimum-value-to-get-positive-step-by-step-sum.py)
[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/) | [Python](/l33tcode/circle-and-rectangle-overlapping.py)
[Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/) | [Python](/l33tcode/synonymous-sentences.py)
[4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard/) | [Python](/l33tcode/4-keys-keyboard.py)
[The Maze II](https://leetcode.com/problems/the-maze-ii/) | [Python](/l33tcode/the-maze-ii.py)
[Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/) | [Python](/l33tcode/check-if-a-string-contains-all-binary-codes-of-size-k.py)
[Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/) | [Python](/l33tcode/best-sightseeing-pair.py)
[First Bad Version](https://leetcode.com/problems/first-bad-version/) | [Python](/l33tcode/first-bad-version.py)
[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/) | [Python](/l33tcode/reveal-cards-in-increasing-order.py)
[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/) | [Python](/l33tcode/moving-average-from-data-stream.py)
[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | [Python](/l33tcode/string-to-integer-atoi.py)
[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | [Python](/l33tcode/backspace-string-compare.py)
[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [Python](/l33tcode/invert-binary-tree.py) [Golang](/l33tcode/invert-binary-tree.go)
[To Lower Case](https://leetcode.com/problems/to-lower-case/) | [Python](/l33tcode/to-lower-case.py)
[Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii/) | [Python](/l33tcode/number-of-distinct-islands-ii.py)
[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | [Python](/l33tcode/divide-two-integers.py)
[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/) | [Python](/l33tcode/subarray-product-less-than-k.py)
[N-Queens](https://leetcode.com/problems/n-queens/) | [Python](/l33tcode/n-queens.py) [Golang](/l33tcode/n-queens.go)
[Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | [Python](/l33tcode/asteroid-collision.py)
[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | [Python](/l33tcode/keys-and-rooms.py) [Golang](/l33tcode/keys-and-rooms.go)
[Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/) | [Python](/l33tcode/advantage-shuffle.py)
[Average Waiting Time](https://leetcode.com/problems/average-waiting-time/) | [Python](/l33tcode/average-waiting-time.py)
[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | [Python](/l33tcode/pacific-atlantic-water-flow.py)
[Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/) | [Python](/l33tcode/get-maximum-in-generated-array.py)
[Maximum Gap](https://leetcode.com/problems/maximum-gap/) | [Python](/l33tcode/maximum-gap.py)
[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [Python](/l33tcode/valid-parentheses.py)
[All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/) | [Python](/l33tcode/all-paths-from-source-to-target.py) [Golang](/l33tcode/all-paths-from-source-to-target.go)
[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/) | [Python](/l33tcode/coordinate-with-maximum-network-quality.py)
[Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/) | [Python](/l33tcode/diagonal-traverse.py)
[Binary Search](https://leetcode.com/problems/binary-search/) | [Python](/l33tcode/binary-search.py)
[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/) | [Python](/l33tcode/determine-if-two-strings-are-close.py) [Golang](/l33tcode/determine-if-two-strings-are-close.go)
[3Sum Closest](https://leetcode.com/problems/3sum-closest/) | [Python](/l33tcode/3sum-closest.py)
[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/) | [Python](/l33tcode/next-greater-node-in-linked-list.py)
[Sqrt(x)](https://leetcode.com/problems/sqrtx/) | [Python](/l33tcode/sqrtx.py)
[4Sum](https://leetcode.com/problems/4sum/) | [Python](/l33tcode/4sum.py)
[Reach a Number](https://leetcode.com/problems/reach-a-number/) | [Python](/l33tcode/reach-a-number.py)
[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [Python](/l33tcode/best-time-to-buy-and-sell-stock-with-transaction-fee.py)
[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/) | [Python](/l33tcode/swapping-nodes-in-a-linked-list.py)
[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/) | [Python](/l33tcode/maximum-sum-bst-in-binary-tree.py)
[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/) | [Python](/l33tcode/valid-boomerang.py)
[Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree/) | [Python](/l33tcode/sum-of-distances-in-tree.py)
[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) | [Python](/l33tcode/check-completeness-of-a-binary-tree.py)
[Combinations](https://leetcode.com/problems/combinations/) | [Python](/l33tcode/combinations.py)
[Array Nesting](https://leetcode.com/problems/array-nesting/) | [Python](/l33tcode/array-nesting.py)
[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/) | [Python](/l33tcode/combination-sum-iii.py)
[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | [Python](/l33tcode/longest-palindrome.py)
[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | [Python](/l33tcode/linked-list-cycle-ii.py)
[String Transforms Into Another String](https://leetcode.com/problems/string-transforms-into-another-string/) | [Python](/l33tcode/string-transforms-into-another-string.py)
[Single Number](https://leetcode.com/problems/single-number/) | [Python](/l33tcode/single-number.py)
[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [Python](/l33tcode/generate-parentheses.py) [Golang](/l33tcode/generate-parentheses.go)
[Distribute Candies](https://leetcode.com/problems/distribute-candies/) | [Python](/l33tcode/distribute-candies.py)
[Word Pattern](https://leetcode.com/problems/word-pattern/) | [Python](/l33tcode/word-pattern.py)
[Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/) | [Python](/l33tcode/design-search-autocomplete-system.py)
[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Python](/l33tcode/median-of-two-sorted-arrays.py)
[Paint House II](https://leetcode.com/problems/paint-house-ii/) | [Python](/l33tcode/paint-house-ii.py)
[Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string/) | [Python](/l33tcode/find-and-replace-in-string.py)
[Summary Ranges](https://leetcode.com/problems/summary-ranges/) | [Python](/l33tcode/summary-ranges.py)
[Implement strStr()](https://leetcode.com/problems/implement-strstr/) | [Python](/l33tcode/implement-strstr.py)
[Tallest Billboard](https://leetcode.com/problems/tallest-billboard/) | [Python](/l33tcode/tallest-billboard.py)
[Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/) | [Python](/l33tcode/length-of-longest-fibonacci-subsequence.py)
[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | [Python](/l33tcode/valid-palindrome-ii.py)
[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/) | [Python](/l33tcode/beautiful-arrangement.py)
[Flood Fill](https://leetcode.com/problems/flood-fill/) | [Python](/l33tcode/flood-fill.py)
[Maximum Binary String After Change](https://leetcode.com/problems/maximum-binary-string-after-change/) | [Python](/l33tcode/maximum-binary-string-after-change.py)
[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | [Python](/l33tcode/sum-root-to-leaf-numbers.py)
[Create Sorted Array through Instructions](https://leetcode.com/problems/create-sorted-array-through-instructions/) | [Python](/l33tcode/create-sorted-array-through-instructions.py)
[Odd Even Jump](https://leetcode.com/problems/odd-even-jump/) | [Python](/l33tcode/odd-even-jump.py)
[Largest Number](https://leetcode.com/problems/largest-number/) | [Python](/l33tcode/largest-number.py)
[Reverse String II](https://leetcode.com/problems/reverse-string-ii/) | [Python](/l33tcode/reverse-string-ii.py)
[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/) | [Python](/l33tcode/peak-index-in-a-mountain-array.py)
[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) | [Python](/l33tcode/longest-increasing-path-in-a-matrix.py)
[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | [Python](/l33tcode/minimum-height-trees.py)
[Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/) | [Python](/l33tcode/sort-integers-by-the-power-value.py)
[Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set/) | [Python](/l33tcode/numbers-at-most-n-given-digit-set.py)
[Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/) | [Python](/l33tcode/filling-bookcase-shelves.py)
[Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/) | [Python](/l33tcode/minimum-domino-rotations-for-equal-row.py)
[Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/) | [Python](/l33tcode/minimum-ascii-delete-sum-for-two-strings.py)
[Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum/) | [Python](/l33tcode/consecutive-numbers-sum.py)
[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | [Python](/l33tcode/binary-tree-zigzag-level-order-traversal.py)
[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | [Python](/l33tcode/sudoku-solver.py)
[Moving Stones Until Consecutive II](https://leetcode.com/problems/moving-stones-until-consecutive-ii/) | [Python](/l33tcode/moving-stones-until-consecutive-ii.py)
[Longest Duplicate Substring](https://leetcode.com/problems/longest-duplicate-substring/) | [Python](/l33tcode/longest-duplicate-substring.py)
[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | [Python](/l33tcode/product-of-array-except-self.py)
[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) | [Python](/l33tcode/minimum-falling-path-sum.py)
[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [Python](/l33tcode/valid-palindrome.py)
[Longest Happy String](https://leetcode.com/problems/longest-happy-string/) | [Python](/l33tcode/longest-happy-string.py)
[One Edit Distance](https://leetcode.com/problems/one-edit-distance/) | [Python](/l33tcode/one-edit-distance.py)
[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | [Python](/l33tcode/minimum-window-substring.py)
[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/) | [Python](/l33tcode/longest-zigzag-path-in-a-binary-tree.py)
[Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/) | [Python](/l33tcode/longest-arithmetic-subsequence-of-given-difference.py)
[Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/) | [Python](/l33tcode/squirrel-simulation.py)
[Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles/) | [Python](/l33tcode/random-point-in-non-overlapping-rectangles.py)
[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | [Python](/l33tcode/compare-version-numbers.py)
[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) | [Python](/l33tcode/longest-harmonious-subsequence.py)
[N-Queens II](https://leetcode.com/problems/n-queens-ii/) | [Golang](/l33tcode/n-queens-ii.go)
[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | [Python](/l33tcode/search-a-2d-matrix.py)
[Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | [Python](/l33tcode/roman-to-integer.py)
[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/) | [Python](/l33tcode/reverse-words-in-a-string-ii.py)
[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/) | [Python](/l33tcode/closest-binary-search-tree-value.py)
[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | [Python](/l33tcode/longest-common-subsequence.py)
[Can Convert String in K Moves](https://leetcode.com/problems/can-convert-string-in-k-moves/) | [Python](/l33tcode/can-convert-string-in-k-moves.py)
[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | [Python](/l33tcode/vertical-order-traversal-of-a-binary-tree.py)
[Path With Maximum Minimum Value](https://leetcode.com/problems/path-with-maximum-minimum-value/) | [Python](/l33tcode/path-with-maximum-minimum-value.py)
[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | [Python](/l33tcode/populating-next-right-pointers-in-each-node.py)
[Minimum Difficulty of a Job Schedule](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/) | [Python](/l33tcode/minimum-difficulty-of-a-job-schedule.py)
[Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/) | [Python](/l33tcode/concatenation-of-consecutive-binary-numbers.py)
[Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/) | [Python](/l33tcode/minimum-cost-for-tickets.py)
[Fancy Sequence](https://leetcode.com/problems/fancy-sequence/) | [Python](/l33tcode/fancy-sequence.py)
[Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner/) | [Python](/l33tcode/robot-room-cleaner.py)
[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | [Python](/l33tcode/guess-number-higher-or-lower.py)
[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | [Python](/l33tcode/count-of-smaller-numbers-after-self.py)
[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [Python](/l33tcode/longest-increasing-subsequence.py)
[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/) | [Python](/l33tcode/shortest-word-distance.py)
[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/) | [Python](/l33tcode/toeplitz-matrix.py)
[Rotate List](https://leetcode.com/problems/rotate-list/) | [Python](/l33tcode/rotate-list.py)
[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | [Python](/l33tcode/swap-nodes-in-pairs.py)
[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [Python](/l33tcode/insert-delete-getrandom-o1.py)
[Smallest Common Region](https://leetcode.com/problems/smallest-common-region/) | [Python](/l33tcode/smallest-common-region.py)
[Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers/) | [Python](/l33tcode/minimum-cost-to-hire-k-workers.py)
[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | [Python](/l33tcode/unique-morse-code-words.py)
[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [Python](/l33tcode/find-median-from-data-stream.py)
[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | [Python](/l33tcode/copy-list-with-random-pointer.py)
[Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/) | [Python](/l33tcode/generate-random-point-in-a-circle.py)
[Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/) | [Python](/l33tcode/maximum-average-subarray-ii.py)
[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/) | [Golang](/l33tcode/count-number-of-teams.go)
[Broken Calculator](https://leetcode.com/problems/broken-calculator/) | [Python](/l33tcode/broken-calculator.py)
[Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/) | [Python](/l33tcode/koko-eating-bananas.py)
[Word Subsets](https://leetcode.com/problems/word-subsets/) | [Python](/l33tcode/word-subsets.py)
[Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network/) | [Python](/l33tcode/critical-connections-in-a-network.py)
[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/) | [Python](/l33tcode/add-two-numbers-ii.py)
[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | [Python](/l33tcode/lowest-common-ancestor-of-a-binary-tree.py)
[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) | [Python](/l33tcode/pascals-triangle-ii.py)
[Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation/) | [Python](/l33tcode/walking-robot-simulation.py)
[First Unique Number](https://leetcode.com/problems/first-unique-number/) | [Python](/l33tcode/first-unique-number.py)
[Ransom Note](https://leetcode.com/problems/ransom-note/) | [Golang](/l33tcode/ransom-note.go)
[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/) | [Python](/l33tcode/maximum-number-of-balloons.py)
[Encode Number](https://leetcode.com/problems/encode-number/) | [Python](/l33tcode/encode-number.py)
[K-Concatenation Maximum Sum](https://leetcode.com/problems/k-concatenation-maximum-sum/) | [Python](/l33tcode/k-concatenation-maximum-sum.py)
[Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/) | [Python](/l33tcode/leftmost-column-with-at-least-a-one.py)
[Insert Interval](https://leetcode.com/problems/insert-interval/) | [Python](/l33tcode/insert-interval.py)
[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) | [Python](/l33tcode/queue-reconstruction-by-height.py) [Golang](/l33tcode/queue-reconstruction-by-height.go)
[Find in Mountain Array](https://leetcode.com/problems/find-in-mountain-array/) | [Python](/l33tcode/find-in-mountain-array.py)
[Rotate Image](https://leetcode.com/problems/rotate-image/) | [Python](/l33tcode/rotate-image.py)
[Stone Game II](https://leetcode.com/problems/stone-game-ii/) | [Python](/l33tcode/stone-game-ii.py)
[Missing Number](https://leetcode.com/problems/missing-number/) | [Python](/l33tcode/missing-number.py)
[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [Python](/l33tcode/add-two-numbers.py)
[Buddy Strings](https://leetcode.com/problems/buddy-strings/) | [Python](/l33tcode/buddy-strings.py)
[Minesweeper](https://leetcode.com/problems/minesweeper/) | [Python](/l33tcode/minesweeper.py)
[Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/) | [Python](/l33tcode/redundant-connection-ii.py)
[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | [Python](/l33tcode/best-time-to-buy-and-sell-stock-iv.py)
[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | [Python](/l33tcode/flatten-nested-list-iterator.py)
[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [Python](/l33tcode/squares-of-a-sorted-array.py)
[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/) | [Python](/l33tcode/leaf-similar-trees.py) [Golang](/l33tcode/leaf-similar-trees.go)
[Plus One](https://leetcode.com/problems/plus-one/) | [Python](/l33tcode/plus-one.py) [Golang](/l33tcode/plus-one.go)
[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) | [Python](/l33tcode/distinct-subsequences.py)
[Parallel Courses II](https://leetcode.com/problems/parallel-courses-ii/) | [Python](/l33tcode/parallel-courses-ii.py)
[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Python](/l33tcode/set-matrix-zeroes.py)
[Majority Element](https://leetcode.com/problems/majority-element/) | [Golang](/l33tcode/majority-element.go)
[Unique Paths](https://leetcode.com/problems/unique-paths/) | [Python](/l33tcode/unique-paths.py)
[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [Golang](/l33tcode/find-all-anagrams-in-a-string.go)
[H-Index II](https://leetcode.com/problems/h-index-ii/) | [Golang](/l33tcode/h-index-ii.go)
[Number of Islands](https://leetcode.com/problems/number-of-islands/) | [Python](/l33tcode/number-of-islands.py)
[Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | [Python](/l33tcode/fibonacci-number.py)
[Design Underground System](https://leetcode.com/problems/design-underground-system/) | [Python](/l33tcode/design-underground-system.py)
[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/) | [Python](/l33tcode/sum-of-root-to-leaf-binary-numbers.py)
[Validate IP Address](https://leetcode.com/problems/validate-ip-address/) | [Python](/l33tcode/validate-ip-address.py)
[Possible Bipartition](https://leetcode.com/problems/possible-bipartition/) | [Python](/l33tcode/possible-bipartition.py) [Golang](/l33tcode/possible-bipartition.go)
[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/) | [Python](/l33tcode/insertion-sort-list.py) [Golang](/l33tcode/insertion-sort-list.go)
[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | [Python](/l33tcode/minimum-path-sum.py)
[Camelcase Matching](https://leetcode.com/problems/camelcase-matching/) | [Python](/l33tcode/camelcase-matching.py)
[Sort List](https://leetcode.com/problems/sort-list/) | [Python](/l33tcode/sort-list.py)
[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | [Python](/l33tcode/range-sum-of-bst.py)
[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) | [Python](/l33tcode/split-array-largest-sum.py)
[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | [Python](/l33tcode/insert-into-a-binary-search-tree.py)
[Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | [Python](/l33tcode/boats-to-save-people.py)
[Circular Array Loop](https://leetcode.com/problems/circular-array-loop/) | [Python](/l33tcode/circular-array-loop.py)
[Find Right Interval](https://leetcode.com/problems/find-right-interval/) | [Python](/l33tcode/find-right-interval.py)
[Single Number III](https://leetcode.com/problems/single-number-iii/) | [Python](/l33tcode/single-number-iii.py)
[Word Squares](https://leetcode.com/problems/word-squares/) | [Python](/l33tcode/word-squares.py)
[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [Python](/l33tcode/intersection-of-two-linked-lists.py)
[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [Python](/l33tcode/balanced-binary-tree.py)
[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/) | [Python](/l33tcode/binary-tree-vertical-order-traversal.py)
[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/) | [Python](/l33tcode/time-needed-to-inform-all-employees.py)
[Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse/) | [Python](/l33tcode/print-immutable-linked-list-in-reverse.py) [Golang](/l33tcode/print-immutable-linked-list-in-reverse.go)
[Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/) | [Python](/l33tcode/maximum-length-of-pair-chain.py)
[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) | [Python](/l33tcode/find-minimum-in-rotated-sorted-array-ii.py)
[Remove Element](https://leetcode.com/problems/remove-element/) | [Python](/l33tcode/remove-element.py)
[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/) | [Python](/l33tcode/two-sum-iii-data-structure-design.py)
[Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/) | [Python](/l33tcode/flatten-a-multilevel-doubly-linked-list.py)
[Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/) | [Python](/l33tcode/minimum-swaps-to-group-all-1s-together.py)
[Single Number II](https://leetcode.com/problems/single-number-ii/) | [Python](/l33tcode/single-number-ii.py)
[Stream of Characters](https://leetcode.com/problems/stream-of-characters/) | [Python](/l33tcode/stream-of-characters.py)
[Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) | [Python](/l33tcode/maximum-points-you-can-obtain-from-cards.py)
[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/) | [Python](/l33tcode/maximum-difference-between-node-and-ancestor.py)
[Decode Ways II](https://leetcode.com/problems/decode-ways-ii/) | [Python](/l33tcode/decode-ways-ii.py)
[Binary Tree Coloring Game](https://leetcode.com/problems/binary-tree-coloring-game/) | [Python](/l33tcode/binary-tree-coloring-game.py)
[Pow(x, n)](https://leetcode.com/problems/powx-n/) | [Python](/l33tcode/powx-n.py) [Golang](/l33tcode/powx-n.go)
[Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/) | [Python](/l33tcode/kth-missing-positive-number.py)
[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/) | [Python](/l33tcode/maximum-level-sum-of-a-binary-tree.py)
[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | [Python](/l33tcode/count-complete-tree-nodes.py)
[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | [Python](/l33tcode/rotting-oranges.py)
[Simplify Path](https://leetcode.com/problems/simplify-path/) | [Python](/l33tcode/simplify-path.py)
[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | [Python](/l33tcode/search-in-a-binary-search-tree.py)
[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | [Python](/l33tcode/reverse-nodes-in-k-group.py)
[Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/) | [Python](/l33tcode/longest-turbulent-subarray.py)
[Thousand Separator](https://leetcode.com/problems/thousand-separator/) | [Python](/l33tcode/thousand-separator.py)
[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/) | [Python](/l33tcode/maximum-binary-tree.py)
[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/) | [Python](/l33tcode/remove-outermost-parentheses.py)
[House Robber III](https://leetcode.com/problems/house-robber-iii/) | [Python](/l33tcode/house-robber-iii.py)
[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Python](/l33tcode/remove-duplicates-from-sorted-list.py)
[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/) | [Python](/l33tcode/repeated-substring-pattern.py)
[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/) | [Python](/l33tcode/find-elements-in-a-contaminated-binary-tree.py)
[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) | [Python](/l33tcode/substring-with-concatenation-of-all-words.py)
[Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/) | [Python](/l33tcode/trim-a-binary-search-tree.py)
[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/) | [Python](/l33tcode/count-servers-that-communicate.py)
[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/) | [Python](/l33tcode/running-sum-of-1d-array.py)
[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | [Python](/l33tcode/pascals-triangle.py)
[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [Python](/l33tcode/kth-largest-element-in-an-array.py)
[Interleaving String](https://leetcode.com/problems/interleaving-string/) | [Python](/l33tcode/interleaving-string.py)
[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [Python](/l33tcode/find-minimum-in-rotated-sorted-array.py)
[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/) | [Python](/l33tcode/the-k-weakest-rows-in-a-matrix.py)
[Find Nearest Right Node in Binary Tree](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/) | [Python](/l33tcode/find-nearest-right-node-in-binary-tree.py)
[Min Stack](https://leetcode.com/problems/min-stack/) | [Python](/l33tcode/min-stack.py)
[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | [Python](/l33tcode/partition-equal-subset-sum.py)
[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) | [Python](/l33tcode/binary-search-tree-to-greater-sum-tree.py)
[Make Array Strictly Increasing](https://leetcode.com/problems/make-array-strictly-increasing/) | [Python](/l33tcode/make-array-strictly-increasing.py)
[Find Peak Element](https://leetcode.com/problems/find-peak-element/) | [Python](/l33tcode/find-peak-element.py)
[Campus Bikes](https://leetcode.com/problems/campus-bikes/) | [Python](/l33tcode/campus-bikes.py)
[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/) | [Python](/l33tcode/check-if-all-1s-are-at-least-length-k-places-away.py)
[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | [Python](/l33tcode/palindrome-pairs.py)
[Shortest Way to Form String](https://leetcode.com/problems/shortest-way-to-form-string/) | [Python](/l33tcode/shortest-way-to-form-string.py)
[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | [Python](/l33tcode/surrounded-regions.py)
[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) | [Python](/l33tcode/recover-binary-search-tree.py)
[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/) | [Python](/l33tcode/count-numbers-with-unique-digits.py)
[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/) | [Python](/l33tcode/peeking-iterator.py)
[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/) | [Python](/l33tcode/two-sum-less-than-k.py)
[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | [Python](/l33tcode/serialize-and-deserialize-binary-tree.py)
[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/) | [Python](/l33tcode/maximum-distance-in-arrays.py)
[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/) | [Python](/l33tcode/sort-characters-by-frequency.py)
[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | [Python](/l33tcode/integer-to-english-words.py)
[Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | [Python](/l33tcode/design-circular-queue.py)
[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/) | [Python](/l33tcode/find-duplicate-subtrees.py)
[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/) | [Python](/l33tcode/find-k-closest-elements.py)
[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Python](/l33tcode/longest-substring-without-repeating-characters.py)
[Combination Sum](https://leetcode.com/problems/combination-sum/) | [Python](/l33tcode/combination-sum.py)
[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/) | [Python](/l33tcode/student-attendance-record-i.py)
[Burst Balloons](https://leetcode.com/problems/burst-balloons/) | [Python](/l33tcode/burst-balloons.py)
[Accounts Merge](https://leetcode.com/problems/accounts-merge/) | [Python](/l33tcode/accounts-merge.py)
[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/) | [Python](/l33tcode/shortest-distance-from-all-buildings.py)
[The Maze](https://leetcode.com/problems/the-maze/) | [Python](/l33tcode/the-maze.py)
[Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/) | [Python](/l33tcode/find-mode-in-binary-search-tree.py)
[Path Sum IV](https://leetcode.com/problems/path-sum-iv/) | [Golang](/l33tcode/path-sum-iv.go)
[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/) | [Python](/l33tcode/longest-absolute-file-path.py)
[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | [Python](/l33tcode/isomorphic-strings.py)
[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) | [Python](/l33tcode/remove-duplicate-letters.py)
[Scramble String](https://leetcode.com/problems/scramble-string/) | [Python](/l33tcode/scramble-string.py)
[Network Delay Time](https://leetcode.com/problems/network-delay-time/) | [Python](/l33tcode/network-delay-time.py)
[Valid Palindrome III](https://leetcode.com/problems/valid-palindrome-iii/) | [Python](/l33tcode/valid-palindrome-iii.py)
[Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/) | [Python](/l33tcode/minimize-deviation-in-array.py)
[Power of Two](https://leetcode.com/problems/power-of-two/) | [Golang](/l33tcode/power-of-two.go)
[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/) | [Python](/l33tcode/meeting-rooms.py)
[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | [Python](/l33tcode/can-place-flowers.py)
[Mirror Reflection](https://leetcode.com/problems/mirror-reflection/) | [Python](/l33tcode/mirror-reflection.py)
[Triangle](https://leetcode.com/problems/triangle/) | [Python](/l33tcode/triangle.py)
[Detect Cycles in 2D Grid](https://leetcode.com/problems/detect-cycles-in-2d-grid/) | [Python](/l33tcode/detect-cycles-in-2d-grid.py)
[Brace Expansion](https://leetcode.com/problems/brace-expansion/) | [Python](/l33tcode/brace-expansion.py)
[All Paths from Source Lead to Destination](https://leetcode.com/problems/all-paths-from-source-lead-to-destination/) | [Python](/l33tcode/all-paths-from-source-lead-to-destination.py)
[Find Root of N-Ary Tree](https://leetcode.com/problems/find-root-of-n-ary-tree/) | [Python](/l33tcode/find-root-of-n-ary-tree.py)
[Similar String Groups](https://leetcode.com/problems/similar-string-groups/) | [Python](/l33tcode/similar-string-groups.py)
[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [Python](/l33tcode/merge-k-sorted-lists.py)
[Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array/) | [Python](/l33tcode/longest-mountain-in-array.py)
[Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [Python](/l33tcode/palindrome-number.py)
[Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/) | [Python](/l33tcode/score-of-parentheses.py)
[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/) | [Python](/l33tcode/student-attendance-record-ii.py)
[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/) | [Golang](/l33tcode/binary-tree-pruning.go)
[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/) | [Python](/l33tcode/find-leaves-of-binary-tree.py)
[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Python](/l33tcode/lowest-common-ancestor-of-a-binary-search-tree.py)
[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/) | [Python](/l33tcode/construct-binary-tree-from-string.py)
[Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages/) | [Python](/l33tcode/largest-sum-of-averages.py)
[Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign/) | [Python](/l33tcode/largest-plus-sign.py)
[Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/) | [Python](/l33tcode/number-of-good-ways-to-split-a-string.py)
[Robot Bounded In Circle](https://leetcode.com/problems/robot-bounded-in-circle/) | [Python](/l33tcode/robot-bounded-in-circle.py)
[Predict the Winner](https://leetcode.com/problems/predict-the-winner/) | [Python](/l33tcode/predict-the-winner.py)
[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/) | [Python](/l33tcode/design-phone-directory.py)
[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [Python](/l33tcode/trapping-rain-water.py)
[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/) | [Python](/l33tcode/serialize-and-deserialize-bst.py)
[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | [Python](/l33tcode/subarray-sum-equals-k.py)
[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Python](/l33tcode/longest-palindromic-substring.py) [Golang](/l33tcode/longest-palindromic-substring.go)
[Frog Jump](https://leetcode.com/problems/frog-jump/) | [Python](/l33tcode/frog-jump.py)
[Subsets](https://leetcode.com/problems/subsets/) | [Python](/l33tcode/subsets.py) [Golang](/l33tcode/subsets.go)
[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | [Python](/l33tcode/daily-temperatures.py)
[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/) | [Python](/l33tcode/defuse-the-bomb.py)
[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | [Python](/l33tcode/combination-sum-iv.py)
[Divisor Game](https://leetcode.com/problems/divisor-game/) | [Python](/l33tcode/divisor-game.py)
[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/) | [Python](/l33tcode/range-sum-query-2d-mutable.py)
[Remove K Digits](https://leetcode.com/problems/remove-k-digits/) | [Python](/l33tcode/remove-k-digits.py) [Golang](/l33tcode/remove-k-digits.go)
[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | [Python](/l33tcode/increasing-triplet-subsequence.py)
[Exam Room](https://leetcode.com/problems/exam-room/) | [Python](/l33tcode/exam-room.py)
[Smallest Sufficient Team](https://leetcode.com/problems/smallest-sufficient-team/) | [Python](/l33tcode/smallest-sufficient-team.py)
[Paint Fence](https://leetcode.com/problems/paint-fence/) | [Python](/l33tcode/paint-fence.py)
[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/) | [Python](/l33tcode/single-element-in-a-sorted-array.py)
[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) | [Python](/l33tcode/word-ladder-ii.py)
[Flower Planting With No Adjacent](https://leetcode.com/problems/flower-planting-with-no-adjacent/) | [Python](/l33tcode/flower-planting-with-no-adjacent.py)
[Length of Last Word](https://leetcode.com/problems/length-of-last-word/) | [Python](/l33tcode/length-of-last-word.py)
[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) | [Python](/l33tcode/linked-list-random-node.py)
[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [Python](/l33tcode/remove-duplicates-from-sorted-array-ii.py)
[Coin Change](https://leetcode.com/problems/coin-change/) | [Python](/l33tcode/coin-change.py)
[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) | [Python](/l33tcode/read-n-characters-given-read4.py)
[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/) | [Python](/l33tcode/non-decreasing-array.py)
[Champagne Tower](https://leetcode.com/problems/champagne-tower/) | [Python](/l33tcode/champagne-tower.py)
[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/) | [Python](/l33tcode/jewels-and-stones.py)
[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/) | [Golang](/l33tcode/find-and-replace-pattern.go)
[Sliding Window Median](https://leetcode.com/problems/sliding-window-median/) | [Python](/l33tcode/sliding-window-median.py)
[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | [Python](/l33tcode/course-schedule-ii.py)
[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | [Python](/l33tcode/maximum-product-of-three-numbers.py)
[Permutation in String](https://leetcode.com/problems/permutation-in-string/) | [Python](/l33tcode/permutation-in-string.py)
[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) | [Python](/l33tcode/find-k-pairs-with-smallest-sums.py)
[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/) | [Python](/l33tcode/convert-bst-to-greater-tree.py)
[Power of Four](https://leetcode.com/problems/power-of-four/) | [Golang](/l33tcode/power-of-four.go)
[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/) | [Python](/l33tcode/valid-mountain-array.py)
[Smallest Range II](https://leetcode.com/problems/smallest-range-ii/) | [Python](/l33tcode/smallest-range-ii.py)
[Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines/) | [Python](/l33tcode/uncrossed-lines.py)
[Path With Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/) | [Python](/l33tcode/path-with-minimum-effort.py)
[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/) | [Python](/l33tcode/prison-cells-after-n-days.py)
[Set Mismatch](https://leetcode.com/problems/set-mismatch/) | [Python](/l33tcode/set-mismatch.py)
[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) | [Python](/l33tcode/permutation-sequence.py)
[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | [Python](/l33tcode/top-k-frequent-words.py)
[Minimum Score Triangulation of Polygon](https://leetcode.com/problems/minimum-score-triangulation-of-polygon/) | [Python](/l33tcode/minimum-score-triangulation-of-polygon.py)
[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [Python](/l33tcode/reverse-linked-list.py)
[Jump Game IV](https://leetcode.com/problems/jump-game-iv/) | [Python](/l33tcode/jump-game-iv.py)
[Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | [Python](/l33tcode/subarray-sums-divisible-by-k.py)
[House Robber II](https://leetcode.com/problems/house-robber-ii/) | [Python](/l33tcode/house-robber-ii.py)
[Find Two Non-overlapping Sub-arrays Each With Target Sum](https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/) | [Python](/l33tcode/find-two-non-overlapping-sub-arrays-each-with-target-sum.py)
[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | [Python](/l33tcode/longest-valid-parentheses.py)
[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/) | [Python](/l33tcode/complement-of-base-10-integer.py)
[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/) | [Golang](/l33tcode/count-square-submatrices-with-all-ones.go)
[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | [Python](/l33tcode/spiral-matrix.py)
[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | [Python](/l33tcode/shortest-unsorted-continuous-subarray.py)
[Reverse String](https://leetcode.com/problems/reverse-string/) | [Python](/l33tcode/reverse-string.py)
[Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner/) | [Python](/l33tcode/grumpy-bookstore-owner.py)
[Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial/) | [Python](/l33tcode/clumsy-factorial.py)
[License Key Formatting](https://leetcode.com/problems/license-key-formatting/) | [Python](/l33tcode/license-key-formatting.py)
[Inorder Successor in BST II](https://leetcode.com/problems/inorder-successor-in-bst-ii/) | [Python](/l33tcode/inorder-successor-in-bst-ii.py)
[Minimum Number of Removals to Make Mountain Array](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/) | [Python](/l33tcode/minimum-number-of-removals-to-make-mountain-array.py)
[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) | [Python](/l33tcode/number-of-steps-to-reduce-a-number-to-zero.py)
[Is Subsequence](https://leetcode.com/problems/is-subsequence/) | [Golang](/l33tcode/is-subsequence.go)
[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | [Python](/l33tcode/populating-next-right-pointers-in-each-node-ii.py)
[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/) | [Python](/l33tcode/short-encoding-of-words.py)
[Find Longest Awesome Substring](https://leetcode.com/problems/find-longest-awesome-substring/) | [Python](/l33tcode/find-longest-awesome-substring.py)
[132 Pattern](https://leetcode.com/problems/132-pattern/) | [Python](/l33tcode/132-pattern.py)
[Decode String](https://leetcode.com/problems/decode-string/) | [Python](/l33tcode/decode-string.py)
[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) | [Python](/l33tcode/n-repeated-element-in-size-2n-array.py)
[Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/) | [Python](/l33tcode/dot-product-of-two-sparse-vectors.py)
[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | [Python](/l33tcode/palindrome-partitioning.py)
[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) | [Python](/l33tcode/minimum-number-of-arrows-to-burst-balloons.py)
[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/) | [Golang](/l33tcode/battleships-in-a-board.go)
[First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | [Python](/l33tcode/first-missing-positive.py)
[Island Perimeter](https://leetcode.com/problems/island-perimeter/) | [Python](/l33tcode/island-perimeter.py)
[Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [Python](/l33tcode/hamming-distance.py)
[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/) | [Python](/l33tcode/encode-and-decode-tinyurl.py)
[Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/) | [Python](/l33tcode/score-after-flipping-matrix.py) [Golang](/l33tcode/score-after-flipping-matrix.go)
[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | [Python](/l33tcode/sort-array-by-increasing-frequency.py)
[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [Python](/l33tcode/maximum-depth-of-binary-tree.py)
[Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/) | [Python](/l33tcode/count-sorted-vowel-strings.py)
[Word Ladder](https://leetcode.com/problems/word-ladder/) | [Python](/l33tcode/word-ladder.py)
[Flipping an Image](https://leetcode.com/problems/flipping-an-image/) | [Python](/l33tcode/flipping-an-image.py)
[Paint House](https://leetcode.com/problems/paint-house/) | [Golang](/l33tcode/paint-house.go)
[Gas Station](https://leetcode.com/problems/gas-station/) | [Python](/l33tcode/gas-station.py)
[Design Browser History](https://leetcode.com/problems/design-browser-history/) | [Python](/l33tcode/design-browser-history.py)
[Print Binary Tree](https://leetcode.com/problems/print-binary-tree/) | [Python](/l33tcode/print-binary-tree.py)
[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | [Python](/l33tcode/unique-binary-search-trees.py) [Golang](/l33tcode/unique-binary-search-trees.go)
[Remove Covered Intervals](https://leetcode.com/problems/remove-covered-intervals/) | [Python](/l33tcode/remove-covered-intervals.py)
[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/) | [Python](/l33tcode/sentence-screen-fitting.py)
[Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/) | [Python](/l33tcode/minimum-window-subsequence.py)
[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | [Python](/l33tcode/palindromic-substrings.py)
[Remove Interval](https://leetcode.com/problems/remove-interval/) | [Python](/l33tcode/remove-interval.py)
[Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/) | [Python](/l33tcode/pseudo-palindromic-paths-in-a-binary-tree.py)
[Word Search II](https://leetcode.com/problems/word-search-ii/) | [Python](/l33tcode/word-search-ii.py)
[Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard/) | [Python](/l33tcode/knight-probability-in-chessboard.py)
[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) | [Python](/l33tcode/fizz-buzz.py)
[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/) | [Python](/l33tcode/graph-valid-tree.py)
[Maximum Average Subtree](https://leetcode.com/problems/maximum-average-subtree/) | [Python](/l33tcode/maximum-average-subtree.py)
[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | [Python](/l33tcode/range-sum-query-immutable.py)
[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/) | [Python](/l33tcode/check-if-two-string-arrays-are-equivalent.py)
[Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | [Python](/l33tcode/integer-to-roman.py)
[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/) | [Python](/l33tcode/binary-prefix-divisible-by-5.py)
[Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst/) | [Python](/l33tcode/inorder-successor-in-bst.py)
[Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/) | [Python](/l33tcode/couples-holding-hands.py)
[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/) | [Python](/l33tcode/consecutive-characters.py)
[Minimum Adjacent Swaps for K Consecutive Ones](https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones/) | [Python](/l33tcode/minimum-adjacent-swaps-for-k-consecutive-ones.py)
[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/) | [Python](/l33tcode/longest-repeating-substring.py)
[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | [Python](/l33tcode/unique-paths-ii.py)
[Best Meeting Point](https://leetcode.com/problems/best-meeting-point/) | [Python](/l33tcode/best-meeting-point.py)
[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock/) | [Python](/l33tcode/angle-between-hands-of-a-clock.py)
[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [Python](/l33tcode/binary-tree-level-order-traversal.py)
[Poor Pigs](https://leetcode.com/problems/poor-pigs/) | [Python](/l33tcode/poor-pigs.py)
[Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/) | [Python](/l33tcode/split-linked-list-in-parts.py)
[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/) | [Python](/l33tcode/distribute-coins-in-binary-tree.py)
[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/) | [Python](/l33tcode/delete-node-in-a-bst.py)
[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/) | [Python](/l33tcode/ones-and-zeroes.py)
[Add Digits](https://leetcode.com/problems/add-digits/) | [Python](/l33tcode/add-digits.py)
[Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | [Python](/l33tcode/design-hit-counter.py)
[Path Sum](https://leetcode.com/problems/path-sum/) | [Python](/l33tcode/path-sum.py)
[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | [Python](/l33tcode/minimum-moves-to-equal-array-elements-ii.py)
[Previous Permutation With One Swap](https://leetcode.com/problems/previous-permutation-with-one-swap/) | [Python](/l33tcode/previous-permutation-with-one-swap.py)
[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Python](/l33tcode/remove-duplicates-from-sorted-array.py)
[Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/) | [Python](/l33tcode/design-front-middle-back-queue.py)
[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/) | [Python](/l33tcode/balance-a-binary-search-tree.py)
[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [Python](/l33tcode/search-a-2d-matrix-ii.py)
[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | [Python](/l33tcode/combination-sum-ii.py)
[Text Justification](https://leetcode.com/problems/text-justification/) | [Python](/l33tcode/text-justification.py)
[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/) | [Python](/l33tcode/encode-and-decode-strings.py)
[Add Binary](https://leetcode.com/problems/add-binary/) | [Python](/l33tcode/add-binary.py)
[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | [Golang](/l33tcode/find-the-town-judge.go)
[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [Python](/l33tcode/binary-tree-maximum-path-sum.py)
[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) | [Python](/l33tcode/unique-binary-search-trees-ii.py)
[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/) | [Golang](/l33tcode/cousins-in-binary-tree.go)
[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/) | [Python](/l33tcode/sort-array-by-parity-ii.py)
[House Robber](https://leetcode.com/problems/house-robber/) | [Python](/l33tcode/house-robber.py)
[01 Matrix](https://leetcode.com/problems/01-matrix/) | [Python](/l33tcode/01-matrix.py)
[Video Stitching](https://leetcode.com/problems/video-stitching/) | [Python](/l33tcode/video-stitching.py)
[Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/) | [Python](/l33tcode/matrix-block-sum.py)
[24 Game](https://leetcode.com/problems/24-game/) | [Python](/l33tcode/24-game.py)
[Bag of Tokens](https://leetcode.com/problems/bag-of-tokens/) | [Python](/l33tcode/bag-of-tokens.py)
[Majority Element II](https://leetcode.com/problems/majority-element-ii/) | [Python](/l33tcode/majority-element-ii.py)
[Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/) | [Python](/l33tcode/increasing-order-search-tree.py)
[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/) | [Python](/l33tcode/minimum-numbers-of-function-calls-to-make-target-array.py)
[Count Submatrices With All Ones](https://leetcode.com/problems/count-submatrices-with-all-ones/) | [Python](/l33tcode/count-submatrices-with-all-ones.py)
[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/) | [Python](/l33tcode/ambiguous-coordinates.py)
[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [Golang](/l33tcode/first-unique-character-in-a-string.go)
[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/) | [Python](/l33tcode/strobogrammatic-number.py)
[Slowest Key](https://leetcode.com/problems/slowest-key/) | [Python](/l33tcode/slowest-key.py)
[Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays/) | [Python](/l33tcode/bitwise-ors-of-subarrays.py)
[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | [Python](/l33tcode/evaluate-reverse-polish-notation.py) [Golang](/l33tcode/evaluate-reverse-polish-notation.go)
[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Python](/l33tcode/maximum-subarray.py)
[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/) | [Python](/l33tcode/repeated-dna-sequences.py)
[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | [Python](/l33tcode/two-city-scheduling.py)
[Permutations II](https://leetcode.com/problems/permutations-ii/) | [Python](/l33tcode/permutations-ii.py)
[Integer Break](https://leetcode.com/problems/integer-break/) | [Python](/l33tcode/integer-break.py)
[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [Python](/l33tcode/merge-two-sorted-lists.py)
[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/) | [Python](/l33tcode/partition-to-k-equal-sum-subsets.py)
[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | [Python](/l33tcode/reverse-linked-list-ii.py)
[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/) | [Python](/l33tcode/maximum-frequency-stack.py)
[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/) | [Python](/l33tcode/sort-array-by-parity.py)
[Dice Roll Simulation](https://leetcode.com/problems/dice-roll-simulation/) | [Python](/l33tcode/dice-roll-simulation.py)
[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/) | [Python](/l33tcode/palindrome-permutation.py)
[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/) | [Golang](/l33tcode/check-if-it-is-a-straight-line.go)
[LFU Cache](https://leetcode.com/problems/lfu-cache/) | [Python](/l33tcode/lfu-cache.py)
[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/) | [Python](/l33tcode/max-consecutive-ones-iii.py)
[LRU Cache](https://leetcode.com/problems/lru-cache/) | [Python](/l33tcode/lru-cache.py)
[Image Overlap](https://leetcode.com/problems/image-overlap/) | [Python](/l33tcode/image-overlap.py)
[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/) | [Golang](/l33tcode/group-the-people-given-the-group-size-they-belong-to.go)
[Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/) | [Python](/l33tcode/design-in-memory-file-system.py)
[Knight Dialer](https://leetcode.com/problems/knight-dialer/) | [Python](/l33tcode/knight-dialer.py)
[Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/) | [Python](/l33tcode/number-of-corner-rectangles.py)
[Walls and Gates](https://leetcode.com/problems/walls-and-gates/) | [Python](/l33tcode/walls-and-gates.py)
[Range Addition](https://leetcode.com/problems/range-addition/) | [Python](/l33tcode/range-addition.py)
[Height Checker](https://leetcode.com/problems/height-checker/) | [Python](/l33tcode/height-checker.py)
[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/) | [Python](/l33tcode/longest-substring-with-at-most-two-distinct-characters.py)
[Guess the Word](https://leetcode.com/problems/guess-the-word/) | [Python](/l33tcode/guess-the-word.py)
[Jump Game II](https://leetcode.com/problems/jump-game-ii/) | [Python](/l33tcode/jump-game-ii.py)
[Design Parking System](https://leetcode.com/problems/design-parking-system/) | [Python](/l33tcode/design-parking-system.py)
[Maximal Square](https://leetcode.com/problems/maximal-square/) | [Python](/l33tcode/maximal-square.py)
[Pancake Sorting](https://leetcode.com/problems/pancake-sorting/) | [Python](/l33tcode/pancake-sorting.py)
[Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [Python](/l33tcode/valid-anagram.py)
[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/) | [Python](/l33tcode/valid-triangle-number.py)
[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | [Python](/l33tcode/range-sum-query-mutable.py)
[Last Stone Weight II](https://leetcode.com/problems/last-stone-weight-ii/) | [Python](/l33tcode/last-stone-weight-ii.py)
[Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points/) | [Python](/l33tcode/min-cost-to-connect-all-points.py)
[Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | [Python](/l33tcode/partition-array-into-three-parts-with-equal-sum.py)
[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | [Golang](/l33tcode/delete-node-in-a-linked-list.go)
[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | [Python](/l33tcode/subdomain-visit-count.py)
[Permutations](https://leetcode.com/problems/permutations/) | [Python](/l33tcode/permutations.py)
[Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences/) | [Python](/l33tcode/numbers-with-same-consecutive-differences.py)
[Partition Labels](https://leetcode.com/problems/partition-labels/) | [Python](/l33tcode/partition-labels.py) [Golang](/l33tcode/partition-labels.go)
[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Python](/l33tcode/binary-tree-preorder-traversal.py)
[Task Scheduler](https://leetcode.com/problems/task-scheduler/) | [Python](/l33tcode/task-scheduler.py)
[Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree/) | [Python](/l33tcode/encode-n-ary-tree-to-binary-tree.py)
[Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/) | [Golang](/l33tcode/maximum-sum-circular-subarray.go)
[Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/) | [Python](/l33tcode/is-graph-bipartite.py)
[Jump Game](https://leetcode.com/problems/jump-game/) | [Python](/l33tcode/jump-game.py) [Golang](/l33tcode/jump-game.go)
[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | [Python](/l33tcode/excel-sheet-column-number.py)
[Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/) | [Python](/l33tcode/regions-cut-by-slashes.py)
[Can I Win](https://leetcode.com/problems/can-i-win/) | [Python](/l33tcode/can-i-win.py)
[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | [Python](/l33tcode/alien-dictionary.py)
[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/) | [Python](/l33tcode/number-of-islands-ii.py)
[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | [Python](/l33tcode/meeting-rooms-ii.py)
[Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/) | [Python](/l33tcode/iterator-for-combination.py)
[Minimum Difference Between Largest and Smallest Value in Three Moves](https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/) | [Python](/l33tcode/minimum-difference-between-largest-and-smallest-value-in-three-moves.py)
[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Python](/l33tcode/merge-sorted-array.py)
[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/) | [Python](/l33tcode/bulls-and-cows.py)
[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/) | [Python](/l33tcode/continuous-subarray-sum.py)
[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [Python](/l33tcode/construct-binary-tree-from-inorder-and-postorder-traversal.py)
[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | [Python](/l33tcode/binary-tree-right-side-view.py)
[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/) | [Python](/l33tcode/min-cost-climbing-stairs.py)
[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | [Python](/l33tcode/zigzag-conversion.py)
[Reformat Date](https://leetcode.com/problems/reformat-date/) | [Python](/l33tcode/reformat-date.py)
[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/) | [Python](/l33tcode/find-k-length-substrings-with-no-repeated-characters.py)
[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [Python](/l33tcode/number-of-1-bits.py)
[Wiggle Sort](https://leetcode.com/problems/wiggle-sort/) | [Python](/l33tcode/wiggle-sort.py)
[Gray Code](https://leetcode.com/problems/gray-code/) | [Python](/l33tcode/gray-code.py)
[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [Python](/l33tcode/wiggle-subsequence.py)
[Count Substrings That Differ by One Character](https://leetcode.com/problems/count-substrings-that-differ-by-one-character/) | [Python](/l33tcode/count-substrings-that-differ-by-one-character.py)
[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/) | [Python](/l33tcode/campus-bikes-ii.py)
[Maximum Performance of a Team](https://leetcode.com/problems/maximum-performance-of-a-team/) | [Python](/l33tcode/maximum-performance-of-a-team.py)
[Reorder List](https://leetcode.com/problems/reorder-list/) | [Python](/l33tcode/reorder-list.py)
[Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station/) | [Python](/l33tcode/minimize-max-distance-to-gas-station.py)
[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/) | [Python](/l33tcode/maximal-rectangle.py)
[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/) | [Python](/l33tcode/2-keys-keyboard.py)
[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/) | [Python](/l33tcode/remove-palindromic-subsequences.py)
[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) | [Python](/l33tcode/arithmetic-slices.py)
[Sort Items by Groups Respecting Dependencies](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/) | [Python](/l33tcode/sort-items-by-groups-respecting-dependencies.py)
[Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/) | [Python](/l33tcode/range-sum-of-sorted-subarray-sums.py)
[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [Python](/l33tcode/bitwise-and-of-numbers-range.py)
[Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/) | [Python](/l33tcode/maximum-xor-of-two-numbers-in-an-array.py)
[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [Python](/l33tcode/linked-list-cycle.py)
[Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/) | [Python](/l33tcode/increasing-decreasing-string.py)
[Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/) | [Python](/l33tcode/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree.py)
[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/) | [Python](/l33tcode/longest-substring-with-at-least-k-repeating-characters.py)
[Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/) | [Python](/l33tcode/shortest-word-distance-ii.py)
[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/) | [Python](/l33tcode/check-array-formation-through-concatenation.py)
[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) | [Python](/l33tcode/valid-perfect-square.py)
[Toss Strange Coins](https://leetcode.com/problems/toss-strange-coins/) | [Python](/l33tcode/toss-strange-coins.py)
[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [Python](/l33tcode/longest-common-prefix.py)
[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/) | [Python](/l33tcode/maximum-number-of-vowels-in-a-substring-of-given-length.py)
[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) | [Python](/l33tcode/interval-list-intersections.py)
[Goat Latin](https://leetcode.com/problems/goat-latin/) | [Python](/l33tcode/goat-latin.py)
[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/) | [Python](/l33tcode/construct-binary-search-tree-from-preorder-traversal.py)
[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/) | [Python](/l33tcode/longest-substring-with-at-most-k-distinct-characters.py)
[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/) | [Python](/l33tcode/flip-equivalent-binary-trees.py)
[Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/) | [Python](/l33tcode/smallest-integer-divisible-by-k.py)
[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | [Golang](/l33tcode/find-all-duplicates-in-an-array.go)
[Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/) | [Python](/l33tcode/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.py)
[Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/) | [Python](/l33tcode/number-of-enclaves.py)
[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | [Python](/l33tcode/middle-of-the-linked-list.py) [Golang](/l33tcode/middle-of-the-linked-list.go)
[Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/) | [Python](/l33tcode/number-of-longest-increasing-subsequence.py)
[Longest Happy Prefix](https://leetcode.com/problems/longest-happy-prefix/) | [Python](/l33tcode/longest-happy-prefix.py)
[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/) | [Python](/l33tcode/find-the-most-competitive-subsequence.py)
[Word Break](https://leetcode.com/problems/word-break/) | [Python](/l33tcode/word-break.py)
[Car Fleet](https://leetcode.com/problems/car-fleet/) | [Python](/l33tcode/car-fleet.py)
[Arranging Coins](https://leetcode.com/problems/arranging-coins/) | [Python](/l33tcode/arranging-coins.py)
[Teemo Attacking](https://leetcode.com/problems/teemo-attacking/) | [Python](/l33tcode/teemo-attacking.py)
[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) | [Python](/l33tcode/ugly-number-ii.py)
[Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/) | [Python](/l33tcode/number-of-sub-arrays-with-odd-sum.py)
[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | [Python](/l33tcode/validate-binary-search-tree.py)
[Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | [Python](/l33tcode/random-pick-with-weight.py)
[Missing Ranges](https://leetcode.com/problems/missing-ranges/) | [Python](/l33tcode/missing-ranges.py)
[Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | [Python](/l33tcode/last-stone-weight.py)
[Next Permutation](https://leetcode.com/problems/next-permutation/) | [Python](/l33tcode/next-permutation.py)
[Maximum Length of a Concatenated String with Unique Characters](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/) | [Python](/l33tcode/maximum-length-of-a-concatenated-string-with-unique-characters.py)
[Binary String With Substrings Representing 1 To N](https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n/) | [Python](/l33tcode/binary-string-with-substrings-representing-1-to-n.py)
[Minimum Cost to Move Chips to The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/) | [Python](/l33tcode/minimum-cost-to-move-chips-to-the-same-position.py)
[Basic Calculator](https://leetcode.com/problems/basic-calculator/) | [Python](/l33tcode/basic-calculator.py)
[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | [Python](/l33tcode/flatten-binary-tree-to-linked-list.py)
[Multiply Strings](https://leetcode.com/problems/multiply-strings/) | [Python](/l33tcode/multiply-strings.py)
[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | [Python](/l33tcode/wildcard-matching.py)
[Minimum Jumps to Reach Home](https://leetcode.com/problems/minimum-jumps-to-reach-home/) | [Python](/l33tcode/minimum-jumps-to-reach-home.py)
[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) | [Python](/l33tcode/max-points-on-a-line.py)
[Target Sum](https://leetcode.com/problems/target-sum/) | [Python](/l33tcode/target-sum.py) [Golang](/l33tcode/target-sum.go)
[Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/) | [Python](/l33tcode/minimum-number-of-increments-on-subarrays-to-form-a-target-array.py)
[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | [Python](/l33tcode/sum-of-left-leaves.py)
[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | [Python](/l33tcode/binary-tree-tilt.py)
[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/) | [Python](/l33tcode/distribute-candies-to-people.py)
[Perform String Shifts](https://leetcode.com/problems/perform-string-shifts/) | [Python](/l33tcode/perform-string-shifts.py)
[Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits/) | [Python](/l33tcode/largest-time-for-given-digits.py)
[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/) | [Python](/l33tcode/max-number-of-k-sum-pairs.py)
[Find Common Characters](https://leetcode.com/problems/find-common-characters/) | [Python](/l33tcode/find-common-characters.py)
[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/) | [Python](/l33tcode/decoded-string-at-index.py)
[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/) | [Python](/l33tcode/minimum-number-of-vertices-to-reach-all-nodes.py)
[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/) | [Python](/l33tcode/all-elements-in-two-binary-search-trees.py)
[Swap For Longest Repeated Character Substring](https://leetcode.com/problems/swap-for-longest-repeated-character-substring/) | [Python](/l33tcode/swap-for-longest-repeated-character-substring.py)
[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | [Python](/l33tcode/diameter-of-binary-tree.py)
[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/) | [Python](/l33tcode/linked-list-in-binary-tree.py)
[Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes/) | [Python](/l33tcode/delete-tree-nodes.py)
[Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Python](/l33tcode/search-insert-position.py) [Golang](/l33tcode/search-insert-position.go)
[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [Python](/l33tcode/binary-tree-inorder-traversal.py)
[Insert into a Sorted Circular Linked List](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/) | [Python](/l33tcode/insert-into-a-sorted-circular-linked-list.py)
[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/) | [Python](/l33tcode/the-skyline-problem.py)
[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/) | [Python](/l33tcode/find-smallest-common-element-in-all-rows.py)
[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/) | [Python](/l33tcode/total-hamming-distance.py)
[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/) | [Python](/l33tcode/plus-one-linked-list.py) [C++](/l33tcode/plus-one-linked-list.cpp)
[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | [Python](/l33tcode/valid-sudoku.py)
[Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/) | [Python](/l33tcode/find-the-celebrity.py)
[Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted/) | [Python](/l33tcode/delete-columns-to-make-sorted.py)
[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Python](/l33tcode/best-time-to-buy-and-sell-stock.py)
[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/) | [Python](/l33tcode/single-row-keyboard.py) [Golang](/l33tcode/single-row-keyboard.go)
[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/) | [Python](/l33tcode/minimum-falling-path-sum-ii.py)
[Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/) | [Python](/l33tcode/search-in-a-sorted-array-of-unknown-size.py)
[Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii/) | [Python](/l33tcode/next-greater-element-iii.py)
[Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | [Python](/l33tcode/minimum-remove-to-make-valid-parentheses.py)
[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | [Python](/l33tcode/implement-trie-prefix-tree.py)
[Game of Life](https://leetcode.com/problems/game-of-life/) | [Python](/l33tcode/game-of-life.py)
[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/) | [Python](/l33tcode/minimum-operations-to-reduce-x-to-zero.py)
[Valid Square](https://leetcode.com/problems/valid-square/) | [Python](/l33tcode/valid-square.py)
[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [Python](/l33tcode/two-sum-ii-input-array-is-sorted.py)
[Word Search](https://leetcode.com/problems/word-search/) | [Python](/l33tcode/word-search.py) [Golang](/l33tcode/word-search.go)
[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) | [Python](/l33tcode/convert-binary-number-in-a-linked-list-to-integer.py)
[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/) | [Python](/l33tcode/valid-parenthesis-string.py)
[Insufficient Nodes in Root to Leaf Paths](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/) | [Python](/l33tcode/insufficient-nodes-in-root-to-leaf-paths.py)
[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [Python](/l33tcode/letter-combinations-of-a-phone-number.py)
[Clone Graph](https://leetcode.com/problems/clone-graph/) | [Python](/l33tcode/clone-graph.py)
[Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/) | [Python](/l33tcode/max-increase-to-keep-city-skyline.py)
[Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays/) | [Python](/l33tcode/number-of-squareful-arrays.py)
[Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7/) | [Python](/l33tcode/implement-rand10-using-rand7.py)
[Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/) | [Python](/l33tcode/cherry-pickup-ii.py)
[Course Schedule](https://leetcode.com/problems/course-schedule/) | [Python](/l33tcode/course-schedule.py)
[Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/) | [Python](/l33tcode/find-the-smallest-divisor-given-a-threshold.py)
[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/) | [Golang](/l33tcode/deepest-leaves-sum.go)
[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/) | [Python](/l33tcode/second-minimum-node-in-a-binary-tree.py)
[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) | [Python](/l33tcode/minimum-add-to-make-parentheses-valid.py)
[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/) | [Python](/l33tcode/maximize-sum-of-array-after-k-negations.py)
[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) | [Python](/l33tcode/two-sum-iv-input-is-a-bst.py)
[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) | [Python](/l33tcode/count-odd-numbers-in-an-interval-range.py)
[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/) | [Python](/l33tcode/the-kth-factor-of-n.py)
[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | [Python](/l33tcode/spiral-matrix-ii.py)
[Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/) | [Python](/l33tcode/zigzag-iterator.py)
[Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [Python](/l33tcode/reverse-bits.py)
[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/) | [Python](/l33tcode/shortest-palindrome.py)
[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) | [Python](/l33tcode/non-overlapping-intervals.py)
[Design an Expression Tree With Evaluate Function](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/) | [Python](/l33tcode/design-an-expression-tree-with-evaluate-function.py)
[Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing/) | [Python](/l33tcode/minimum-swaps-to-make-sequences-increasing.py) [Golang](/l33tcode/minimum-swaps-to-make-sequences-increasing.go)
[Open the Lock](https://leetcode.com/problems/open-the-lock/) | [Python](/l33tcode/open-the-lock.py)
[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | [Python](/l33tcode/binary-tree-postorder-traversal.py)
[Output Contest Matches](https://leetcode.com/problems/output-contest-matches/) | [Golang](/l33tcode/output-contest-matches.go)
[Coin Change 2](https://leetcode.com/problems/coin-change-2/) | [Golang](/l33tcode/coin-change-2.go)
[Coin Change II](https://leetcode.com/problems/coin-change-ii/) | [Python](l33tcode/coin-change-ii.py)
[Happy Number](https://leetcode.com/problems/happy-number/) | [Python](/l33tcode/happy-number.py)
[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [Python](/l33tcode/symmetric-tree.py)
[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | [Python](/l33tcode/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.py)
[Design HashSet](https://leetcode.com/problems/design-hashset/) | [Python](/l33tcode/design-hashset.py)
[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/) | [Python](/l33tcode/number-of-students-unable-to-eat-lunch.py)
[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/) | [Python](/l33tcode/sort-the-matrix-diagonally.py)
[Dungeon Game](https://leetcode.com/problems/dungeon-game/) | [Python](/l33tcode/dungeon-game.py)
[Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/) | [Python](/l33tcode/greatest-sum-divisible-by-three.py)
[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [Python](/l33tcode/remove-all-adjacent-duplicates-in-string.py)
[Airplane Seat Assignment Probability](https://leetcode.com/problems/airplane-seat-assignment-probability/) | [Python](/l33tcode/airplane-seat-assignment-probability.py)
[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/) | [Python](/l33tcode/widest-vertical-area-between-two-points-containing-no-points.py)
[Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/) | [Python](/l33tcode/arithmetic-slices-ii-subsequence.py)
[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) | [Python](/l33tcode/add-one-row-to-tree.py)
[Decode Ways](https://leetcode.com/problems/decode-ways/) | [Python](/l33tcode/decode-ways.py)
[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | [Golang](/l33tcode/find-the-duplicate-number.go)
[Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [Python](/l33tcode/container-with-most-water.py)
[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) | [Python](/l33tcode/best-time-to-buy-and-sell-stock-iii.py)
[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | [Python](/l33tcode/largest-rectangle-in-histogram.py)
[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/) | [Python](/l33tcode/find-the-longest-substring-containing-vowels-in-even-counts.py)
[Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | [Python](/l33tcode/design-add-and-search-words-data-structure.py)
[Minimum Deletions to Make String Balanced](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/) | [Python](/l33tcode/minimum-deletions-to-make-string-balanced.py)
[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/) | [Python](/l33tcode/android-unlock-patterns.py)
[Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling/) | [Python](/l33tcode/domino-and-tromino-tiling.py)
[Push Dominoes](https://leetcode.com/problems/push-dominoes/) | [Python](/l33tcode/push-dominoes.py)
[Minimum Insertions to Balance a Parentheses String](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/) | [Python](/l33tcode/minimum-insertions-to-balance-a-parentheses-string.py)
[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | [Python](/l33tcode/basic-calculator-ii.py)
[Meeting Scheduler](https://leetcode.com/problems/meeting-scheduler/) | [Python](/l33tcode/meeting-scheduler.py)
[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | [Python](/l33tcode/kth-smallest-element-in-a-bst.py)
[Same Tree](https://leetcode.com/problems/same-tree/) | [Python](/l33tcode/same-tree.py) [Golang](/l33tcode/same-tree.go)
[Number of Ways to Form a Target String Given a Dictionary](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/) | [Python](/l33tcode/number-of-ways-to-form-a-target-string-given-a-dictionary.py)
[Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling/) | [Python](/l33tcode/maximum-profit-in-job-scheduling.py)
[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) | [Python](/l33tcode/longest-subarray-of-1s-after-deleting-one-element.py)
[Partition List](https://leetcode.com/problems/partition-list/) | [Python](/l33tcode/partition-list.py)
[Last Substring in Lexicographical Order](https://leetcode.com/problems/last-substring-in-lexicographical-order/) | [Python](/l33tcode/last-substring-in-lexicographical-order.py)
[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | [Python](/l33tcode/regular-expression-matching.py)
[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | [Python](/l33tcode/range-sum-query-2d-immutable.py)
[Path Sum III](https://leetcode.com/problems/path-sum-iii/) | [Python](/l33tcode/path-sum-iii.py)
[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | [Python](/l33tcode/remove-duplicates-from-sorted-list-ii.py)
[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [Python](/l33tcode/climbing-stairs.py)
[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/) | [Python](/l33tcode/fruit-into-baskets.py)
[Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/) | [Python](/l33tcode/maximum-width-of-binary-tree.py) [Golang](/l33tcode/maximum-width-of-binary-tree.go)
[Find the Difference](https://leetcode.com/problems/find-the-difference/) | [Python](/l33tcode/find-the-difference.py)
[Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/) | [Python](/l33tcode/pizza-with-3n-slices.py)
[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [Python](/l33tcode/top-k-frequent-elements.py)
[Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/) | [Python](/l33tcode/number-of-distinct-islands.py)
[Stone Game IV](https://leetcode.com/problems/stone-game-iv/) | [Python](/l33tcode/stone-game-iv.py)
[Heaters](https://leetcode.com/problems/heaters/) | [Python](/l33tcode/heaters.py)
[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | [Python](/l33tcode/k-closest-points-to-origin.py)
[Perfect Squares](https://leetcode.com/problems/perfect-squares/) | [Python](/l33tcode/perfect-squares.py)
[Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/) | [Python](/l33tcode/longest-line-of-consecutive-one-in-matrix.py)
[Count Largest Group](https://leetcode.com/problems/count-largest-group/) | [Python](/l33tcode/count-largest-group.py)
[Shopping Offers](https://leetcode.com/problems/shopping-offers/) | [Python](/l33tcode/shopping-offers.py)
[Jump Game III](https://leetcode.com/problems/jump-game-iii/) | [Python](/l33tcode/jump-game-iii.py)
[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | [Python](/l33tcode/average-of-levels-in-binary-tree.py)
[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [Python](/l33tcode/maximum-product-subarray.py)
[Longest String Chain](https://leetcode.com/problems/longest-string-chain/) | [Python](/l33tcode/longest-string-chain.py)
[Reaching Points](https://leetcode.com/problems/reaching-points/) | [Python](/l33tcode/reaching-points.py)
[H-Index](https://leetcode.com/problems/h-index/) | [Python](/l33tcode/h-index.py)
[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | [Python](/l33tcode/k-diff-pairs-in-an-array.py)
[Find Permutation](https://leetcode.com/problems/find-permutation/) | [Python](/l33tcode/find-permutation.py)
[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Python](/l33tcode/find-first-and-last-position-of-element-in-sorted-array.py)
[Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [Python](/l33tcode/group-anagrams.py)
[Word Break II](https://leetcode.com/problems/word-break-ii/) | [Python](/l33tcode/word-break-ii.py)
[Two Sum](https://leetcode.com/problems/two-sum/) | [Python](/l33tcode/two-sum.py)
[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/) | [Python](/l33tcode/number-of-students-doing-homework-at-a-given-time.py)
[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/) | [Python](/l33tcode/shortest-distance-to-a-character.py)
[Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [Python](/l33tcode/merge-intervals.py)
[Car Pooling](https://leetcode.com/problems/car-pooling/) | [Python](/l33tcode/car-pooling.py)
[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/) | [Python](/l33tcode/letter-case-permutation.py)
[Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/) | [Python](/l33tcode/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.py)
[Move Zeroes](https://leetcode.com/problems/move-zeroes/) | [Python](/l33tcode/move-zeroes.py)
[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) | [Python](/l33tcode/binary-tree-level-order-traversal-ii.py)
[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) | [Python](/l33tcode/unique-email-addresses.py)
[Sort Colors](https://leetcode.com/problems/sort-colors/) | [Python](/l33tcode/sort-colors.py)
[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | [Python](/l33tcode/logger-rate-limiter.py)
[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) | [Python](/l33tcode/read-n-characters-given-read4-ii-call-multiple-times.py)
[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/) | [Golang](/l33tcode/sum-of-nodes-with-even-valued-grandparent.go)
[Hexspeak](https://leetcode.com/problems/hexspeak/) | [Python](/l33tcode/hexspeak.py)
[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | [Golang](/l33tcode/odd-even-linked-list.go)
[Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/) | [Python](/l33tcode/smallest-subtree-with-all-the-deepest-nodes.py)
[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | [Python](/l33tcode/shortest-path-in-binary-matrix.py)
[Rotate Array](https://leetcode.com/problems/rotate-array/) | [Python](/l33tcode/rotate-array.py)
[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [Python](/l33tcode/longest-consecutive-sequence.py)
[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/) | [Python](/l33tcode/capacity-to-ship-packages-within-d-days.py) [Golang](/l33tcode/capacity-to-ship-packages-within-d-days.go)
[Number of Dice Rolls With Target Sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/) | [Python](/l33tcode/number-of-dice-rolls-with-target-sum.py)
[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/) | [Python](/l33tcode/unique-paths-iii.py)
[Monotonic Array](https://leetcode.com/problems/monotonic-array/) | [Python](/l33tcode/monotonic-array.py)
[Edit Distance](https://leetcode.com/problems/edit-distance/) | [Python](/l33tcode/edit-distance.py)
[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Python](/l33tcode/search-in-rotated-sorted-array.py) [Golang](/l33tcode/search-in-rotated-sorted-array.go)
[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/) | [Python](/l33tcode/delete-nodes-and-return-forest.py)
[Kill Process](https://leetcode.com/problems/kill-process/) | [Python](/l33tcode/kill-process.py)
[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | [Python](/l33tcode/n-th-tribonacci-number.py)
[Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/) | [Python](/l33tcode/shortest-path-in-a-grid-with-obstacles-elimination.py)
[Making A Large Island](https://leetcode.com/problems/making-a-large-island/) | [Python](/l33tcode/making-a-large-island.py)
[Check If It Is a Good Array](https://leetcode.com/problems/check-if-it-is-a-good-array/) | [Python](/l33tcode/check-if-it-is-a-good-array.py)
[Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/) | [Python](/l33tcode/lowest-common-ancestor-of-deepest-leaves.py)
[Jump Game VI](https://leetcode.com/problems/jump-game-vi/) | [Python](/l33tcode/jump-game-vi.py)
[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | [Python](/l33tcode/next-greater-element-i.py)
[Kth Ancestor of a Tree Node](https://leetcode.com/problems/kth-ancestor-of-a-tree-node/) | [Python](/l33tcode/kth-ancestor-of-a-tree-node.py)
[Buildings With an Ocean View](https://leetcode.com/problems/buildings-with-an-ocean-view/) | [Python](/l33tcode/buildings-with-an-ocean-view.py)
[Divide Chocolate](https://leetcode.com/problems/divide-chocolate/) | [Python](/l33tcode/divide-chocolate.py)
[Number of Valid Words for Each Puzzle](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle/) | [Python](/l33tcode/number-of-valid-words-for-each-puzzle.py)
[Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/) | [Python](/l33tcode/kth-smallest-number-in-multiplication-table.py)
[Employee Free Time](https://leetcode.com/problems/employee-free-time/) | [Python](/l33tcode/employee-free-time.py)
[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/) | [Python](/l33tcode/richest-customer-wealth.py)
[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | [Python](/l33tcode/longest-repeating-character-replacement.py)
[Count Sub Islands](https://leetcode.com/problems/count-sub-islands/) | [Python](/l33tcode/count-sub-islands.py)
[Sort an Array](https://leetcode.com/problems/sort-an-array/) | [Python](/l33tcode/sort-an-array.py)
[Number of Ways to Split a String](https://leetcode.com/problems/number-of-ways-to-split-a-string/) | [Python](/l33tcode/number-of-ways-to-split-a-string.py)
[Maximum White Tiles Covered by a Carpet](https://leetcode.com/problems/maximum-white-tiles-covered-by-a-carpet/) | [Python](/l33tcode/maximum-white-tiles-covered-by-a-carpet.py)
[Evaluate the Bracket Pairs of a String](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/) | [Python](/l33tcode/evaluate-the-bracket-pairs-of-a-string.py)
[Valid Number](https://leetcode.com/problems/valid-number/) | [Python](/l33tcode/valid-number.py)
[Sequentially Ordinal Rank Tracker](https://leetcode.com/problems/sequentially-ordinal-rank-tracker/) | [Python](/l33tcode/sequentially-ordinal-rank-tracker.py)
[Recyclable and Low Fat Products](https://leetcode.com/problems/recyclable-and-low-fat-products/) | [SQL](/l33tcode/recyclable-and-low-fat-products.sql)
[Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports/) | [SQL](/l33tcode/managers-with-at-least-5-direct-reports.sql)
[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/) | [Python](/l33tcode/count-of-range-sum.py)
[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/) | [Python](/l33tcode/expression-add-operators.py)
[Best Position for a Service Centre](https://leetcode.com/problems/best-position-for-a-service-centre/) | [Python](/l33tcode/best-position-for-a-service-centre.py)
[Subsets II](https://leetcode.com/problems/subsets-ii/) | [Python](/l33tcode/subsets-ii.py)
[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | [Python](/l33tcode/restore-ip-addresses.py)
[Count Ways to Make Array With Product](https://leetcode.com/problems/count-ways-to-make-array-with-product/) | [Python](/l33tcode/count-ways-to-make-array-with-product.py)
[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/) | [Python](/l33tcode/add-to-array-form-of-integer.py)
[Redundant Connection](https://leetcode.com/problems/redundant-connection/) | [Python](/l33tcode/redundant-connection.py)
[Subarray With Elements Greater Than Varying Threshold](https://leetcode.com/problems/subarray-with-elements-greater-than-varying-threshold/) | [Python](/l33tcode/subarray-with-elements-greater-than-varying-threshold.py)
[Number of Ways to Buy Pens and Pencils](https://leetcode.com/problems/number-of-ways-to-buy-pens-and-pencils/) | [Python](/l33tcode/number-of-ways-to-buy-pens-and-pencils.py)
[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/) | [Python](/l33tcode/closest-binary-search-tree-value-ii.py)
[Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences/) | [Python](/l33tcode/split-array-into-consecutive-subsequences.py)
[Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops/) | [Python](/l33tcode/problems/minimum-number-of-refueling-stops.py)
[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/) | [Python](/l33tcode/binary-tree-longest-consecutive-sequence-ii.py)
[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/) | [Python](/l33tcode/maximum-length-of-subarray-with-positive-product.py)
[Finding the Number of Visible Mountains](https://leetcode.com/problems/finding-the-number-of-visible-mountains/) | [Python](/l33tcode/finding-the-number-of-visible-mountains.py)
[Minimum Replacements to Sort the Array](https://leetcode.com/problems/minimum-replacements-to-sort-the-array/) | [Python](/l33tcode/minimum-replacements-to-sort-the-array.py)
[Count Number of Bad Pairs](https://leetcode.com/problems/count-number-of-bad-pairs/) | [Python](/l33tcode/count-number-of-bad-pairs.py)
[Closest Node to Path in Tree](https://leetcode.com/problems/closest-node-to-path-in-tree/) | [Python](/l33tcode/closest-node-to-path-in-tree.py)
[Move Pieces to Obtain a String](https://leetcode.com/problems/move-pieces-to-obtain-a-string/) | [Python](/l33tcode/move-pieces-to-obtain-a-string.py)
[Count Integers in Intervals](https://leetcode.com/problems/count-integers-in-intervals/) | [Python](/l33tcode/count-integers-in-intervals.py)
[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) | [Python](/l33tcode/count-good-nodes-in-binary-tree.py)
[Minimum Flips in Binary Tree to Get Result](https://leetcode.com/problems/minimum-flips-in-binary-tree-to-get-result/) | [Python](/l33tcode/minimum-flips-in-binary-tree-to-get-result.py)
[Design Video Sharing Platform](https://leetcode.com/problems/design-video-sharing-platform/) | [Python](/l33tcode/design-video-sharing-platform.py)
[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/) | [Python](/l33tcode/construct-string-from-binary-tree.py)
[Earliest Possible Day of Full Bloom](https://leetcode.com/problems/earliest-possible-day-of-full-bloom/) | [Golang](/l33tcode/earliest-possible-day-of-full-bloom.go)
[Repeated String Match](https://leetcode.com/problems/repeated-string-match/) | [Python](/l33tcode/repeated-string-match.py)
[The Maze III](https://leetcode.com/problems/the-maze-iii/) | [Python](/l33tcode/the-maze-iii.py)
[Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/) | [Python](/l33tcode/design-excel-sum-formula.py)
[Find Players With Zero or One Losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses/) | [Golang](/l33tcode/find-players-with-zero-or-one-losses.go)
[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [Golang](/l33tcode/unique-number-of-occurrences.go)
[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/) | [Golang](/l33tcode/determine-if-string-halves-are-alike.go)
[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/) | [Golang](/l33tcode/minimum-average-difference.go)
[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | [Golang](/l33tcode/implement-queue-using-stacks.go)
[Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/) | [Golang](/l33tcode/find-if-path-exists-in-graph.go)
[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/) | [Golang](/l33tcode/maximum-bags-with-full-capacity-of-rocks.go)
[Remove Stones to Minimize the Total](https://leetcode.com/problems/remove-stones-to-minimize-the-total/) | [Python](/l33tcode/remove-stones-to-minimize-the-total.py)
[All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees/) | [Python](/l33tcode/all-possible-full-binary-trees.py)
[Minimum Speed to Arrive on Time](https://leetcode.com/problems/minimum-speed-to-arrive-on-time/) | [Python](/l33tcode/minimum-speed-to-arrive-on-time.py)
[Soup Servings](https://leetcode.com/problems/soup-servings/) | [Python](/l33tcode/soup-servings.py)
[Maximum Running Time of N Computers](https://leetcode.com/problems/maximum-running-time-of-n-computers/) | [Python](/l33tcode/maximum-running-time-of-n-computers.py)
[Strange Printer](https://leetcode.com/problems/strange-printer/) | [Python](/l33tcode/strange-printer.py)
[Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists/) | [Python](/l33tcode/number-of-music-playlists.py)
[Minimize the Maximum Difference of Pairs](https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs/) | [Python](/l33tcode/minimize-the-maximum-difference-of-pairs.py) [Rust](/l33tcode/minimize-the-maximum-difference-of-pairs.rs)
[Check if There is a Valid Partition For The Array](https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array/) | [Python](/l33tcode/check-if-there-is-a-valid-partition-for-the-array.py)
[Maximal Network Rank](https://leetcode.com/problems/maximal-network-rank/) | [Python](/l33tcode/maximal-network-rank.py)
[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | [Python](/l33tcode/excel-sheet-column-title.py)
[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | [Python](/l33tcode/implement-stack-using-queues.py)
[Minimum Penalty for a Shop](https://leetcode.com/problems/minimum-penalty-for-a-shop/) | [Python](/l33tcode/minimum-penalty-for-a-shop.py)
[Minimum Number of Taps to Open to Water a Garden](https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/) | [Python](/l33tcode/minimum-number-of-taps-to-open-to-water-a-garden.py)
[Extra Characters in a String](https://leetcode.com/problems/extra-characters-in-a-string/) | [Python](/l33tcode/extra-characters-in-a-string.py)
[Count All Valid Pickup and Delivery Options](https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options/) | [Python](/l33tcode/count-all-valid-pickup-and-delivery-options.py)
[Minimum Deletions to Make Character Frequencies Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/) | [Python](/l33tcode/minimum-deletions-to-make-character-frequencies-unique.py)
[Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes/) | [Python](/l33tcode/shortest-path-visiting-all-nodes.py)
[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | [Python](/l33tcode/reverse-words-in-a-string-iii.py)
[Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/) | [Python](/l33tcode/remove-colored-pieces-if-both-neighbors-are-the-same-color.py)
[Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/) | [Python](/l33tcode/number-of-good-pairs.py)
[Max Dot Product of Two Subsequences](https://leetcode.com/problems/max-dot-product-of-two-subsequences/) | [Python](/l33tcode/max-dot-product-of-two-subsequences.py)
[Minimum Number of Operations to Make Array Continuous](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/) | [Python](/l33tcode/minimum-number-of-operations-to-make-array-continuous.py)
[Number of Flowers in Full Bloom](https://leetcode.com/problems/number-of-flowers-in-full-bloom/) | [Python](/l33tcode/number-of-flowers-in-full-bloom.py)
[Painting the Walls](https://leetcode.com/problems/painting-the-walls/) | [Python](/l33tcode/painting-the-walls.py)
[Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/) | [Python](/l33tcode/number-of-ways-to-stay-in-the-same-place-after-some-steps.py)
[Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/) | [Python](/l33tcode/validate-binary-tree-nodes.py)
[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/) | [Python](/l33tcode/parallel-courses-iii.py)
[Constrained Subsequence Sum](https://leetcode.com/problems/constrained-subsequence-sum/) | [Python](/l33tcode/constrained-subsequence-sum.py)
[Maximum Score of a Good Subarray](https://leetcode.com/problems/maximum-score-of-a-good-subarray/) | [Python](/l33tcode/find-largest-value-in-each-tree-row.py)
[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/) | [Python](/l33tcode/binary-trees-with-factors.py)
[Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation/) | [Python](/l33tcode/count-vowels-permutation.py)
[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/) | [Python](/l33tcode/sort-integers-by-the-number-of-1-bits.py)
[Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/) | [Python](/l33tcode/find-the-original-array-of-prefix-xor.py)
[Count Nodes Equal to Average of Subtree](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/) | [Python](/l33tcode/count-nodes-equal-to-average-of-subtree.py)
[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/) | [Python](/l33tcode/build-an-array-with-stack-operations.py)
[Last Moment Before All Ants Fall Out of a Plank](https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank/) | [Python](/l33tcode/build-an-array-with-stack-operations.py)
[Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/) | [Python](/l33tcode/find-the-winner-of-an-array-game.py)
[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/) | [Python](/l33tcode/seat-reservation-manager.py)
[Eliminate Maximum Number of Monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters/) | [Python](/l33tcode/eliminate-maximum-number-of-monsters.py)
[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/) | [Python](/l33tcode/count-number-of-homogenous-substrings.py)
[Determine if a Cell Is Reachable at a Given Time](https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time/) | [Python](/l33tcode/determine-if-a-cell-is-reachable-at-a-given-time.py)
[Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/) | [Python](/l33tcode/restore-the-array-from-adjacent-pairs.py)
[Design Graph With Shortest Path Calculator](https://leetcode.com/problems/design-graph-with-shortest-path-calculator/) | [Python](/l33tcode/restore-the-array-from-adjacent-pairs.py)
[Bus Routes](https://leetcode.com/problems/bus-routes/) | [Python](/l33tcode/bus-routes.py)
[Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/) | [Python](/l33tcode/unique-length-3-palindromic-subsequences.py)
[Reduction Operations to Make the Array Elements Equal](https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal/) | [Python](/l33tcode/reduction-operations-to-make-the-array-elements-equal.py)
[Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/) | [Python](/l33tcode/count-nice-pairs-in-an-array.py)
[Diagonal Traverse II](https://leetcode.com/problems/diagonal-traverse-ii/) | [Python](/l33tcode/diagonal-traverse-ii.py)
[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/) | [Python](/l33tcode/arithmetic-subarrays.py)
[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/) | [Python](/l33tcode/maximum-number-of-coins-you-can-get.py)
[Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/) | [Python](/l33tcode/sum-of-absolute-differences-in-a-sorted-array.py)
[Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/) | [Python](/l33tcode/largest-submatrix-with-rearrangements.py)
[Number of Ways to Divide a Long Corridor](https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor/) | [Python](/l33tcode/number-of-ways-to-divide-a-long-corridor.py)
[Minimum Number of Operations to Make Array Empty](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty/) | [Python](/l33tcode/minimum-number-of-operations-to-make-array-empty.py)