Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/cowienduckie/daily-leet-code

Solutions for LeetCode daily problems
https://github.com/cowienduckie/daily-leet-code

dsa-practice leetcode python3

Last synced: 3 days ago
JSON representation

Solutions for LeetCode daily problems

Awesome Lists containing this project

README 

        
# Daily LeetCode



This repository contains my solutions to LeetCode problems. I will be solving at least one problem every day.



## Solved Problems (Total: 143)

| # | Problem | Solution |

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

| 0001 | [Two Sum](https://leetcode.com/problems/two-sum) | [src/0001_two-sum.py](src/0001_two-sum.py) |

| 0003 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [src/0003_longest-substring-without-repeating-characters.py](src/0003_longest-substring-without-repeating-characters.py) |

| 0004 | [Median Of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [src/0004_median-of-two-sorted-arrays.py](src/0004_median-of-two-sorted-arrays.py) |

| 0005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [src/0005_longest-palindromic-substring.py](src/0005_longest-palindromic-substring.py) |

| 0011 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [src/0011_container-with-most-water.py](src/0011_container-with-most-water.py) |

| 0015 | [3Sum](https://leetcode.com/problems/3sum) | [src/0015_3sum.py](src/0015_3sum.py) |

| 0017 | [Letter Combinations Of A Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [src/0017_letter-combinations-of-a-phone-number.py](src/0017_letter-combinations-of-a-phone-number.py) |

| 0019 | [Remove Nth Node From End Of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [src/0019_remove-nth-node-from-end-of-list.py](src/0019_remove-nth-node-from-end-of-list.py) |

| 0020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [src/0020_valid-parentheses.py](src/0020_valid-parentheses.py) |

| 0021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [src/0021_merge-two-sorted-lists.py](src/0021_merge-two-sorted-lists.py) |

| 0022 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [src/0022_generate-parentheses.py](src/0022_generate-parentheses.py) |

| 0023 | [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [src/0023_merge-k-sorted-lists.py](src/0023_merge-k-sorted-lists.py) |

| 0033 | [Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [src/0033_search-in-rotated-sorted-array.py](src/0033_search-in-rotated-sorted-array.py) |

| 0036 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [src/0036_valid-sudoku.py](src/0036_valid-sudoku.py) |

| 0037 | [Sudoku_Solver](https://leetcode.com/problems/sudoku_solver) | [src/0037_sudoku_solver.py](src/0037_sudoku_solver.py) |

| 0040 | [Combination Sum Ii](https://leetcode.com/problems/combination-sum-ii) | [src/0040_combination-sum-ii.py](src/0040_combination-sum-ii.py) |

| 0041 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [src/0041_first-missing-positive.py](src/0041_first-missing-positive.py) |

| 0046 | [Permutations](https://leetcode.com/problems/permutations) | [src/0046_permutations.py](src/0046_permutations.py) |

| 0048 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [src/0048_rotate-image.py](src/0048_rotate-image.py) |

| 0049 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [src/0049_group-anagrams.py](src/0049_group-anagrams.py) |

| 0053 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [src/0053_maximum-subarray.py](src/0053_maximum-subarray.py) |

| 0054 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [src/0054_spiral-matrix.py](src/0054_spiral-matrix.py) |

| 0056 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [src/0056_merge-intervals.py](src/0056_merge-intervals.py) |

| 0057 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [src/0057_insert-interval.py](src/0057_insert-interval.py) |

| 0073 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [src/0073_set-matrix-zeroes.py](src/0073_set-matrix-zeroes.py) |

| 0074 | [Search A 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [src/0074_search-a-2d-matrix.py](src/0074_search-a-2d-matrix.py) |

| 0075 | [Sort_Colors](https://leetcode.com/problems/sort_colors) | [src/0075_sort_colors.py](src/0075_sort_colors.py) |

| 0077 | [Combinations](https://leetcode.com/problems/combinations) | [src/0077_combinations.py](src/0077_combinations.py) |

| 0078 | [Subsets](https://leetcode.com/problems/subsets) | [src/0078_subsets.py](src/0078_subsets.py) |

| 0079 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [src/0079_minimum-window-substring.py](src/0079_minimum-window-substring.py) |

| 0088 | [Merge_Sorted_Array](https://leetcode.com/problems/merge_sorted_array) | [src/0088_merge_sorted_array.py](src/0088_merge_sorted_array.py) |

| 0090 | [Subsets Ii](https://leetcode.com/problems/subsets-ii) | [src/0090_subsets-ii.py](src/0090_subsets-ii.py) |

| 0098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [src/0098_validate-binary-search-tree.py](src/0098_validate-binary-search-tree.py) |

| 0100 | [Same Tree](https://leetcode.com/problems/same-tree) | [src/0100_same-tree.py](src/0100_same-tree.py) |

| 0102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [src/0102_binary-tree-level-order-traversal.py](src/0102_binary-tree-level-order-traversal.py) |

| 0104 | [Max Depth Of Binary Tree](https://leetcode.com/problems/max-depth-of-binary-tree) | [src/0104_max-depth-of-binary-tree.py](src/0104_max-depth-of-binary-tree.py) |

| 0105 | [Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [src/0105_construct-binary-tree-from-preorder-and-inorder-traversal.py](src/0105_construct-binary-tree-from-preorder-and-inorder-traversal.py) |

| 0121 | [Best Time To Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [src/0121_best-time-to-buy-and-sell-stock.py](src/0121_best-time-to-buy-and-sell-stock.py) |

| 0125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [src/0125_valid-palindrome.py](src/0125_valid-palindrome.py) |

| 0133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [src/0133_clone-graph.py](src/0133_clone-graph.py) |

| 0134 | [Reorder Linked List](https://leetcode.com/problems/reorder-linked-list) | [src/0134_reorder-linked-list.py](src/0134_reorder-linked-list.py) |

| 0139 | [Word Break](https://leetcode.com/problems/word-break) | [src/0139_word-break.py](src/0139_word-break.py) |

| 0141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [src/0141_linked-list-cycle.py](src/0141_linked-list-cycle.py) |

| 0146 | [Lru Cache](https://leetcode.com/problems/lru-cache) | [src/0146_lru-cache.py](src/0146_lru-cache.py) |

| 0150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [src/0150_evaluate-reverse-polish-notation.py](src/0150_evaluate-reverse-polish-notation.py) |

| 0152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [src/0152_maximum-product-subarray.py](src/0152_maximum-product-subarray.py) |

| 0153 | [Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [src/0153_find-minimum-in-rotated-sorted-array.py](src/0153_find-minimum-in-rotated-sorted-array.py) |

| 0155 | [Min Stack](https://leetcode.com/problems/min-stack) | [src/0155_min-stack.py](src/0155_min-stack.py) |

| 0179 | [Largest Number](https://leetcode.com/problems/largest-number) | [src/0179_largest-number.py](src/0179_largest-number.py) |

| 0199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [src/0199_binary-tree-right-side-view.py](src/0199_binary-tree-right-side-view.py) |

| 0200 | [Number Of Islands](https://leetcode.com/problems/number-of-islands) | [src/0200_number-of-islands.py](src/0200_number-of-islands.py) |

| 0206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [src/0206_reverse-linked-list.py](src/0206_reverse-linked-list.py) |

| 0207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [src/0207_course-schedule.py](src/0207_course-schedule.py) |

| 0208 | [Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree) | [src/0208_implement-trie-prefix-tree.py](src/0208_implement-trie-prefix-tree.py) |

| 0211 | [Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure) | [src/0211_design-add-and-search-words-data-structure.py](src/0211_design-add-and-search-words-data-structure.py) |

| 0215 | [Kth Largest Element In An Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [src/0215_kth-largest-element-in-an-array.py](src/0215_kth-largest-element-in-an-array.py) |

| 0217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [src/0217_contains-duplicate.py](src/0217_contains-duplicate.py) |

| 0225 | [Implement Stack Using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [src/0225_implement-stack-using-queues.py](src/0225_implement-stack-using-queues.py) |

| 0226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [src/0226_invert-binary-tree.py](src/0226_invert-binary-tree.py) |

| 0227 | [Basic Calculator Ii](https://leetcode.com/problems/basic-calculator-ii) | [src/0227_basic-calculator-ii.py](src/0227_basic-calculator-ii.py) |

| 0230 | [Kth Smallest Element In A Bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [src/0230_kth-smallest-element-in-a-bst.py](src/0230_kth-smallest-element-in-a-bst.py) |

| 0232 | [Implement Queue Using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [src/0232_implement-queue-using-stacks.py](src/0232_implement-queue-using-stacks.py) |

| 0235 | [Lowest Common Ancestor Of A Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [src/0235_lowest-common-ancestor-of-a-binary-search-tree.py](src/0235_lowest-common-ancestor-of-a-binary-search-tree.py) |

| 0236 | [Lowest Common Ancestor Of A Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [src/0236_lowest-common-ancestor-of-a-binary-tree.py](src/0236_lowest-common-ancestor-of-a-binary-tree.py) |

| 0238 | [Product Of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [src/0238_product-of-array-except-self.py](src/0238_product-of-array-except-self.py) |

| 0239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [src/0239_sliding-window-maximum.py](src/0239_sliding-window-maximum.py) |

| 0242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [src/0242_valid-anagram.py](src/0242_valid-anagram.py) |

| 0264 | [Ugly Number Ii](https://leetcode.com/problems/ugly-number-ii) | [src/0264_ugly-number-ii.py](src/0264_ugly-number-ii.py) |

| 0274 | [H Index](https://leetcode.com/problems/h-index) | [src/0274_h-index.py](src/0274_h-index.py) |

| 0295 | [Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [src/0295_find-median-from-data-stream.py](src/0295_find-median-from-data-stream.py) |

| 0297 | [Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [src/0297_serialize-and-deserialize-binary-tree.py](src/0297_serialize-and-deserialize-binary-tree.py) |

| 0347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [src/0347_top-k-frequent-elements.py](src/0347_top-k-frequent-elements.py) |

| 0378 | [Kth Smallest Element In A Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [src/0378_kth-smallest-element-in-a-sorted-matrix.py](src/0378_kth-smallest-element-in-a-sorted-matrix.py) |

| 0380 | [Insert Delete Getrandom O1](https://leetcode.com/problems/insert-delete-getrandom-o1) | [src/0380_insert-delete-getrandom-o1.py](src/0380_insert-delete-getrandom-o1.py) |

| 0383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [src/0383_ransom-note.py](src/0383_ransom-note.py) |

| 0417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [src/0417_pacific-atlantic-water-flow.py](src/0417_pacific-atlantic-water-flow.py) |

| 0424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [src/0424_longest-repeating-character-replacement.py](src/0424_longest-repeating-character-replacement.py) |

| 0435 | [Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [src/0435_non-overlapping-intervals.py](src/0435_non-overlapping-intervals.py) |

| 0438 | [Find All Anagrams In A String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [src/0438_find-all-anagrams-in-a-string.py](src/0438_find-all-anagrams-in-a-string.py) |

| 0476 | [Number Complement](https://leetcode.com/problems/number-complement) | [src/0476_number-complement.py](src/0476_number-complement.py) |

| 0516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [src/0516_longest-palindromic-subsequence.py](src/0516_longest-palindromic-subsequence.py) |

| 0539 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [src/0539_minimum-time-difference.py](src/0539_minimum-time-difference.py) |

| 0542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | [src/0542_01-matrix.py](src/0542_01-matrix.py) |

| 0572 | [Subtree Of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [src/0572_subtree-of-another-tree.py](src/0572_subtree-of-another-tree.py) |

| 0622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [src/0622_design-circular-queue.py](src/0622_design-circular-queue.py) |

| 0624 | [Maximum Distance In Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | [src/0624_maximum-distance-in-arrays.py](src/0624_maximum-distance-in-arrays.py) |

| 0650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [src/0650_2-keys-keyboard.py](src/0650_2-keys-keyboard.py) |

| 0670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [src/0670_maximum-swap.py](src/0670_maximum-swap.py) |

| 0704 | [Binary Search](https://leetcode.com/problems/binary-search) | [src/0704_binary-search.py](src/0704_binary-search.py) |

| 0719 | [Find K Th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [src/0719_find-k-th-smallest-pair-distance.py](src/0719_find-k-th-smallest-pair-distance.py) |

| 0725 | [Split Linked List In Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [src/0725_split-linked-list-in-parts.py](src/0725_split-linked-list-in-parts.py) |

| 0733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | [src/0733_flood-fill.py](src/0733_flood-fill.py) |

| 0735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [src/0735_asteroid-collision.py](src/0735_asteroid-collision.py) |

| 0739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [src/0739_daily-temperatures.py](src/0739_daily-temperatures.py) |

| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | [src/796_rotate-string.py](src/796_rotate-string.py) |

| 0860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [src/0860_lemonade-change.py](src/0860_lemonade-change.py) |

| 0874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [src/0874_walking-robot-simulation.py](src/0874_walking-robot-simulation.py) |

| 0884 | [Uncommon Words From Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [src/0884_uncommon-words-from-two-sentences.py](src/0884_uncommon-words-from-two-sentences.py) |

| 0921 | [Minimum Add To Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [src/0921_minimum-add-to-make-parentheses-valid.py](src/0921_minimum-add-to-make-parentheses-valid.py) |

| 0947 | [Most Stones Removed With Same Row Or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [src/0947_most-stones-removed-with-same-row-or-column.py](src/0947_most-stones-removed-with-same-row-or-column.py) |

| 0951 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [src/0951_flip-equivalent-binary-trees.py](src/0951_flip-equivalent-binary-trees.py) |

| 0962 | [Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp) | [src/0962_maximum-width-ramp.py](src/0962_maximum-width-ramp.py) |

| 0973 | [K Closest Points To Origin](https://leetcode.com/problems/k-closest-points-to-origin) | [src/0973_k-closest-points-to-origin.py](src/0973_k-closest-points-to-origin.py) |

| 0994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges) | [src/0994_rotting-oranges.py](src/0994_rotting-oranges.py) |

| 1106 | [Parsing A Boolean Expression](https://leetcode.com/problems/parsing-a-boolean-expression) | [src/1106_parsing-a-boolean-expression.py](src/1106_parsing-a-boolean-expression.py) |

| 1233 | [Remove Sub Folders From The Filesystem](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem) | [src/1233_remove-sub-folders-from-the-filesystem.py](src/1233_remove-sub-folders-from-the-filesystem.py) |

| 1277 | [Count Square Submatrices With All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones) | [src/1277_count-square-submatrices-with-all-ones.py](src/1277_count-square-submatrices-with-all-ones.py) |

| 1310 | [Xor Queries Of A Subarray](https://leetcode.com/problems/xor-queries-of-a-subarray) | [src/1310_xor-queries-of-a-subarray.py](src/1310_xor-queries-of-a-subarray.py) |

| 1371 | [Find The Longest Substring Containing Vowels In Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts) | [src/1371_find-the-longest-substring-containing-vowels-in-even-counts.py](src/1371_find-the-longest-substring-containing-vowels-in-even-counts.py) |

| 1405 | [Longest Happy String](https://leetcode.com/problems/longest-happy-string) | [src/1405_longest-happy-string.py](src/1405_longest-happy-string.py) |

| 1514 | [Path With Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability) | [src/1514_path-with-maximum-probability.py](src/1514_path-with-maximum-probability.py) |

| 1545 | [Find Kth Bit In Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string) | [src/1545_find-kth-bit-in-nth-binary-string.py](src/1545_find-kth-bit-in-nth-binary-string.py) |

| 1593 | [Split A String Into The Max Number Of Unique Substrings](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings) | [src/1593_split-a-string-into-the-max-number-of-unique-substrings.py](src/1593_split-a-string-into-the-max-number-of-unique-substrings.py) |

| 1684 | [Count The Number Of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings) | [src/1684_count-the-number-of-consistent-strings.py](src/1684_count-the-number-of-consistent-strings.py) |

| 1829 | [Maximum Xor For Each Query](https://leetcode.com/problems/maximum-xor-for-each-query) | [src/1829_maximum-xor-for-each-query.py](src/1829_maximum-xor-for-each-query.py) |

| 1894 | [Find The Student That Will Replace The Chalk](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk) | [src/1894_find-the-student-that-will-replace-the-chalk.py](src/1894_find-the-student-that-will-replace-the-chalk.py) |

| 1905 | [Count Sub Islands](https://leetcode.com/problems/count-sub-islands) | [src/1905_count-sub-islands.py](src/1905_count-sub-islands.py) |

| 1942 | [The Number Of The Smallest Unoccupied Chair](https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair) | [src/1942_the-number-of-the-smallest-unoccupied-chair.py](src/1942_the-number-of-the-smallest-unoccupied-chair.py) |

| 1945 | [Sum Of Digits Of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert) | [src/1945_sum-of-digits-of-string-after-convert.py](src/1945_sum-of-digits-of-string-after-convert.py) |

| 1957 | [Delete Characters To Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string) | [src/1957_delete-characters-to-make-fancy-string.py](src/1957_delete-characters-to-make-fancy-string.py) |

| 1963 | [Minimum Number Of Swaps To Make The String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced) | [src/1963_minimum-number-of-swaps-to-make-the-string-balanced.py](src/1963_minimum-number-of-swaps-to-make-the-string-balanced.py) |

| 2022 | [Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array) | [src/2022_convert-1d-array-into-2d-array.py](src/2022_convert-1d-array-into-2d-array.py) |

| 2028 | [Find Missing Observations](https://leetcode.com/problems/find-missing-observations) | [src/2028_find-missing-observations.py](src/2028_find-missing-observations.py) |

| 2044 | [Count Number Of Maximum Bitwise Or Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets) | [src/2044_count-number-of-maximum-bitwise-or-subsets.py](src/2044_count-number-of-maximum-bitwise-or-subsets.py) |

| 2070 | [Most Beautiful Item For Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query) | [src/2070_most-beautiful-item-for-each-query.py](src/2070_most-beautiful-item-for-each-query.py) |

| 2275 | [Largest Combination With Bitwise And Greater Than Zero](https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero) | [src/2275_largest-combination-with-bitwise-and-greater-than-zero.py](src/2275_largest-combination-with-bitwise-and-greater-than-zero.py) |

| 2419 | [Longest Subarray With Maximum Bitwise And](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and) | [src/2419_longest-subarray-with-maximum-bitwise-and.py](src/2419_longest-subarray-with-maximum-bitwise-and.py) |

| 2458 | [Height Of Binary Tree After Subtree Removal Queries](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries) | [src/2458_height-of-binary-tree-after-subtree-removal-queries.py](src/2458_height-of-binary-tree-after-subtree-removal-queries.py) |

| 2490 | [Circular Sentence](https://leetcode.com/problems/circular-sentence) | [src/2490_circular-sentence.py](src/2490_circular-sentence.py) |

| 2501 | [Longest Square Streak In An Array](https://leetcode.com/problems/longest-square-streak-in-an-array) | [src/2501_longest-square-streak-in-an-array.py](src/2501_longest-square-streak-in-an-array.py) |

| 2530 | [Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations) | [src/2530_maximal-score-after-applying-k-operations.py](src/2530_maximal-score-after-applying-k-operations.py) |

| 2563 | [Count The Number Of Fair Pairs](https://leetcode.com/problems/count-the-number-of-fair-pairs) | [src/2563_count-the-number-of-fair-pairs.py](src/2563_count-the-number-of-fair-pairs.py) |

| 2583 | [Kth Largest Sum In A Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree) | [src/2583_kth-largest-sum-in-a-binary-tree.py](src/2583_kth-largest-sum-in-a-binary-tree.py) |

| 2601 | [Prime Subtraction Operation](https://leetcode.com/problems/prime-subtraction-operation) | [src/2601_prime-subtraction-operation.py](src/2601_prime-subtraction-operation.py) |

| 2641 | [Cousins In Binary Tree Ii](https://leetcode.com/problems/cousins-in-binary-tree-ii) | [src/2641_cousins-in-binary-tree-ii.py](src/2641_cousins-in-binary-tree-ii.py) |

| 2684 | [Maximum Number Of Moves In A Grid](https://leetcode.com/problems/maximum-number-of-moves-in-a-grid) | [src/2684_maximum-number-of-moves-in-a-grid.py](src/2684_maximum-number-of-moves-in-a-grid.py) |

| 2696 | [Minimum String Length After Removing Substrings](https://leetcode.com/problems/minimum-string-length-after-removing-substrings) | [src/2696_minimum-string-length-after-removing-substrings.py](src/2696_minimum-string-length-after-removing-substrings.py) |

| 2914 | [Minimum Number Of Changes To Make Binary String Beautiful](https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful) | [src/2914_minimum-number-of-changes-to-make-binary-string-beautiful.py](src/2914_minimum-number-of-changes-to-make-binary-string-beautiful.py) |

| 2938 | [Separate Black And White Balls](https://leetcode.com/problems/separate-black-and-white-balls) | [src/2938_separate-black-and-white-balls.py](src/2938_separate-black-and-white-balls.py) |

| 3011 | [Find If Array Can Be Sorted](https://leetcode.com/problems/find-if-array-can-be-sorted) | [src/3011_find-if-array-can-be-sorted.py](src/3011_find-if-array-can-be-sorted.py) |

| 3097 | [Shortest Subarray With Or At Least K Ii](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii) | [src/3097_shortest-subarray-with-or-at-least-k-ii.py](src/3097_shortest-subarray-with-or-at-least-k-ii.py) |

| 3133 | [Minimum Array End](https://leetcode.com/problems/minimum-array-end) | [src/3133_minimum-array-end.py](src/3133_minimum-array-end.py) |

| 3163 | [String Compression Iii](https://leetcode.com/problems/string-compression-iii) | [src/3163_string-compression-iii.py](src/3163_string-compression-iii.py) |