From c04cabd17a57fa36f90e2382b7c97d2f4d27a0ac Mon Sep 17 00:00:00 2001 From: Zanger67 Date: Fri, 5 Jul 2024 17:36:37 -0700 Subject: [PATCH] Daily --- .Readme Updater | 2 +- README.md | 180 +++++++------- markdowns/Daily_Questions.md | 79 ++++--- markdowns/Questions_By_Code_Length.md | 176 +++++++------- markdowns/Questions_By_Recent.md | 176 +++++++------- markdowns/Topics.md | 10 +- markdowns/_2582. Pass the Pillow.md | 114 +++++++++ ...Longest Repeating Character Replacement.md | 222 ++++++++++++++++++ markdowns/by_topic/Array.md | 82 +++---- markdowns/by_topic/Backtracking.md | 2 +- markdowns/by_topic/Binary Search Tree.md | 2 +- markdowns/by_topic/Binary Search.md | 8 +- markdowns/by_topic/Binary Tree.md | 16 +- markdowns/by_topic/Bit Manipulation.md | 16 +- markdowns/by_topic/Brainteaser.md | 2 +- markdowns/by_topic/Breadth-First Search.md | 18 +- markdowns/by_topic/Combinatorics.md | 4 +- markdowns/by_topic/Counting Sort.md | 4 +- markdowns/by_topic/Counting.md | 6 +- markdowns/by_topic/Depth-First Search.md | 24 +- markdowns/by_topic/Design.md | 4 +- markdowns/by_topic/Dynamic Programming.md | 6 +- markdowns/by_topic/Graph.md | 6 +- markdowns/by_topic/Greedy.md | 22 +- markdowns/by_topic/Hash Function.md | 2 +- markdowns/by_topic/Hash Table.md | 43 ++-- markdowns/by_topic/Heap (Priority Queue).md | 4 +- markdowns/by_topic/Interactive.md | 4 +- markdowns/by_topic/Linked List.md | 20 +- markdowns/by_topic/Math.md | 27 ++- markdowns/by_topic/Matrix.md | 12 +- markdowns/by_topic/Monotonic Queue.md | 2 +- markdowns/by_topic/Monotonic Stack.md | 4 +- markdowns/by_topic/Prefix Sum.md | 6 +- markdowns/by_topic/Queue.md | 4 +- markdowns/by_topic/Randomized.md | 2 +- markdowns/by_topic/Recursion.md | 6 +- markdowns/by_topic/Reservoir Sampling.md | 2 +- markdowns/by_topic/Rolling Hash.md | 2 +- markdowns/by_topic/Simulation.md | 57 ++--- markdowns/by_topic/Sliding Window.md | 7 +- markdowns/by_topic/Sorting.md | 28 +-- markdowns/by_topic/Stack.md | 22 +- markdowns/by_topic/String.md | 43 ++-- markdowns/by_topic/Suffix Array.md | 2 +- markdowns/by_topic/Topological Sort.md | 2 +- markdowns/by_topic/Tree.md | 18 +- markdowns/by_topic/Trie.md | 4 +- markdowns/by_topic/Two Pointers.md | 30 +-- markdowns/by_topic/Union Find.md | 2 +- my-submissions/e2582 Daily.py | 7 + my-submissions/e2582.c | 7 + my-submissions/e2582.cpp | 10 + my-submissions/e2582.cs | 9 + my-submissions/e2582.java | 9 + my-submissions/e2582.js | 12 + .../m424 v1 O(n) but inefficient.py | 21 ++ .../m424 v2 40 percent improvement.py | 27 +++ .../m424 v3 Additional bit of performance.py | 27 +++ ...24 v4 Removed O(k) Summations for Math.py | 27 +++ my-submissions/m424 v5 Optimal.py | 15 ++ my-submissions/m424.md | 52 ++++ 62 files changed, 1165 insertions(+), 594 deletions(-) create mode 100644 markdowns/_2582. Pass the Pillow.md create mode 100644 markdowns/_424. Longest Repeating Character Replacement.md create mode 100644 my-submissions/e2582 Daily.py create mode 100644 my-submissions/e2582.c create mode 100644 my-submissions/e2582.cpp create mode 100644 my-submissions/e2582.cs create mode 100644 my-submissions/e2582.java create mode 100644 my-submissions/e2582.js create mode 100644 my-submissions/m424 v1 O(n) but inefficient.py create mode 100644 my-submissions/m424 v2 40 percent improvement.py create mode 100644 my-submissions/m424 v3 Additional bit of performance.py create mode 100644 my-submissions/m424 v4 Removed O(k) Summations for Math.py create mode 100644 my-submissions/m424 v5 Optimal.py create mode 100644 my-submissions/m424.md diff --git a/.Readme Updater b/.Readme Updater index 7eb1e86b..0be97613 160000 --- a/.Readme Updater +++ b/.Readme Updater @@ -1 +1 @@ -Subproject commit 7eb1e86b494bd12561746497f7ed91180a6fe44d +Subproject commit 0be97613a382b5e35797681c0fd470c772e0477c diff --git a/README.md b/README.md index 8f1bbf13..e69cec17 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,4 @@ -# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (392 solved) +# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (394 solved) > My LeetCode Profile: [Zanger](https://leetcode.com/u/Zanger/) @@ -28,7 +28,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, ------ -[Array](), [String](), [Hash Table](), [Depth-First Search](), [Tree](), [Binary Tree](), [Sorting](), [Breadth-First Search](), [Math](), [Two Pointers](), [Linked List](), [Stack](), [Greedy](), [Matrix](), [Simulation](), [Bit Manipulation](), [Dynamic Programming](), [Design](), [Database](), [Binary Search](), [Trie](), [Heap (Priority Queue)](), [Counting](), [Recursion](), [Backtracking](), [Binary Search Tree](), [Prefix Sum](), [Sliding Window](), [Monotonic Stack](), [Queue](), [Union Find](), [Divide and Conquer](), [String Matching](), [Graph](), [Hash Function](), [Combinatorics](), [Monotonic Queue](), [Iterator](), [Bucket Sort](), [Geometry](), [Counting Sort](), [Brainteaser](), [Game Theory](), [Interactive](), [Memoization](), [Rolling Hash](), [Quickselect](), [Randomized](), [Doubly-Linked List](), [Data Stream](), [Bitmask](), [Merge Sort](), [Ordered Set](), [Suffix Array](), [Topological Sort](), [Shortest Path](), [Number Theory](), [Reservoir Sampling]() +[Array](), [String](), [Hash Table](), [Depth-First Search](), [Tree](), [Binary Tree](), [Sorting](), [Breadth-First Search](), [Math](), [Two Pointers](), [Linked List](), [Stack](), [Greedy](), [Matrix](), [Simulation](), [Bit Manipulation](), [Dynamic Programming](), [Design](), [Database](), [Binary Search](), [Trie](), [Heap (Priority Queue)](), [Counting](), [Recursion](), [Backtracking](), [Binary Search Tree](), [Sliding Window](), [Prefix Sum](), [Monotonic Stack](), [Queue](), [Union Find](), [Divide and Conquer](), [String Matching](), [Graph](), [Hash Function](), [Combinatorics](), [Monotonic Queue](), [Iterator](), [Bucket Sort](), [Geometry](), [Counting Sort](), [Brainteaser](), [Game Theory](), [Interactive](), [Memoization](), [Rolling Hash](), [Quickselect](), [Randomized](), [Doubly-Linked List](), [Data Stream](), [Bitmask](), [Merge Sort](), [Ordered Set](), [Suffix Array](), [Topological Sort](), [Shortest Path](), [Number Theory](), [Reservoir Sampling]() ------ @@ -37,7 +37,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, ## Questions | # | Title | Level | Cats | Solution | Languages | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:-------------------------------------------------------------------------------------------------------------|:---------------------------------| -| 1 | [Two Sum]() | Easy | N150, B75 | [solution]() | java, py | +| 1 | [Two Sum]() | Easy | N150, B75 | [solution]() | py, java | | 2 | [Add Two Numbers]() | Medium | N150 | [solution]() | java | | 3 | [Longest Substring Without Repeating Characters]() | Medium | N150, B75 | [solution]() | java | | 5 | [Longest Palindromic Substring]() | Medium | N150, B75 | [solution]() | py | @@ -45,7 +45,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 8 | [String to Integer (atoi)]() | Medium | | [solution]() | py | | 9 | [Palindrome Number]() | Easy | | [solution]() | java | | 14 | [Longest Common Prefix]() | Easy | | [solution]() | java | -| 19 | [Remove Nth Node From End of List]() | Medium | N150, B75 | [solution]() | c, java, py | +| 19 | [Remove Nth Node From End of List]() | Medium | N150, B75 | [solution]() | py, java, c | | 20 | [Valid Parentheses]() | Easy | N150, B75 | [solution]() | java | | 21 | [Merge Two Sorted Lists]() | Easy | N150, B75 | [solution]() | java | | 22 | [Generate Parentheses]() | Medium | N150 | [solution]() | py | @@ -53,13 +53,13 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 24 | [Swap Nodes in Pairs]() | Medium | | [solution]() | c | | 25 | [Reverse Nodes in k-Group]() | Hard | N150 | [solution]() | c | | 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution]() | java | -| 27 | [Remove Element]() | Easy | | [solution]() | java, py | +| 27 | [Remove Element]() | Easy | | [solution]() | py, java | | 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution]() | py | | 36 | [Valid Sudoku]() | Medium | N150 | [solution]() | py | | 46 | [Permutations]() | Medium | N150 | [solution]() | py | -| 48 | [Rotate Image]() | Medium | N150, B75 | [solution]() | c, py | +| 48 | [Rotate Image]() | Medium | N150, B75 | [solution]() | py, c | | 49 | [Group Anagrams]() | Medium | N150, B75 | [solution]() | py | -| 50 | [Pow(x, n)]() | Medium | N150 | [solution]() | c, java, py | +| 50 | [Pow(x, n)]() | Medium | N150 | [solution]() | py, java, c | | 56 | [Merge Intervals]() | Medium | N150, B75 | [solution]() | py | | 57 | [Insert Interval]() | Medium | N150, B75 | [solution]() | py | | 61 | [Rotate List]() | Medium | | [solution]() | py | @@ -68,14 +68,14 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 70 | [Climbing Stairs]() | Easy | N150, B75 | [solution]() | py | | 71 | [Simplify Path]() | Medium | | [solution]() | py | | 74 | [Search a 2D Matrix]() | Medium | N150 | [solution]() | py | -| 75 | [Sort Colors]() | Medium | Daily | [solution]() | c, py | +| 75 | [Sort Colors]() | Medium | Daily | [solution]() | py, c | | 77 | [Combinations]() | Medium | | [solution]() | py | | 78 | [Subsets]() | Medium | N150 | [solution]() | py | | 79 | [Word Search]() | Medium | N150, B75 | [solution]() | py | | 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution]() | py | | 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution]() | py | | 90 | [Subsets II]() | Medium | N150 | [solution]() | py | -| 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution]() | java, py | +| 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution]() | py, java | | 98 | [Validate Binary Search Tree]() | Medium | N150, B75 | [solution]() | c | | 100 | [Same Tree]() | Easy | N150, B75 | [solution]() | py | | 102 | [Binary Tree Level Order Traversal]() | Medium | N150, B75 | [solution]() | java | @@ -83,24 +83,24 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 104 | [Maximum Depth of Binary Tree]() | Easy | N150, B75 | [solution]() | py | | 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution]() | java | | 110 | [Balanced Binary Tree]() | Easy | N150 | [solution]() | py | -| 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution]() | c, java | +| 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution]() | java, c | | 112 | [Path Sum]() | Easy | | [solution]() | py | | 113 | [Path Sum II]() | Medium | | [solution]() | py | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution]() | c, py | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution]() | py, c | | 118 | [Pascal's Triangle]() | Easy | | [solution]() | py | | 121 | [Best Time to Buy and Sell Stock]() | Easy | N150, B75 | [solution]() | py | | 124 | [Binary Tree Maximum Path Sum]() | Hard | N150, B75 | [solution]() | py | -| 125 | [Valid Palindrome]() | Easy | N150, B75 | [solution]() | c, py | -| 128 | [Longest Consecutive Sequence]() | Medium | N150, B75 | [solution]() | java, py | +| 125 | [Valid Palindrome]() | Easy | N150, B75 | [solution]() | py, c | +| 128 | [Longest Consecutive Sequence]() | Medium | N150, B75 | [solution]() | py, java | | 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution]() | py | | 136 | [Single Number]() | Easy | N150 | [solution]() | py | | 138 | [Copy List with Random Pointer]() | Medium | N150 | [solution]() | py | -| 141 | [Linked List Cycle]() | Easy | N150, B75 | [solution]() | c, py | +| 141 | [Linked List Cycle]() | Easy | N150, B75 | [solution]() | py, c | | 142 | [Linked List Cycle II]() | Medium | | [solution]() | py | -| 143 | [Reorder List]() | Medium | N150, B75 | [solution]() | java, py | +| 143 | [Reorder List]() | Medium | N150, B75 | [solution]() | py, java | | 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution]() | py | | 155 | [Min Stack]() | Medium | N150 | [solution]() | py | -| 165 | [Compare Version Numbers]() | Medium | | [solution]() | c, py | +| 165 | [Compare Version Numbers]() | Medium | | [solution]() | py, c | | 166 | [Fraction to Recurring Decimal]() | Medium | | [solution]() | py | | 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution]() | py | | 173 | [Binary Search Tree Iterator]() | Medium | | [solution]() | py | @@ -129,7 +129,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | N150, B75 | [solution]() | py | | 238 | [Product of Array Except Self]() | Medium | N150, B75 | [solution]() | py | | 239 | [Sliding Window Maximum]() | Hard | N150 | [solution]() | py | -| 242 | [Valid Anagram]() | Easy | N150, B75 | [solution]() | c, py | +| 242 | [Valid Anagram]() | Easy | N150, B75 | [solution]() | py, c | | 251 | [Flatten 2D Vector]() | Medium | | [solution]() | py | | 260 | [Single Number III]() | Medium | Daily | [solution]() | py | | 271 | [Encode and Decode Strings]() | Medium | N150, B75 | [solution]() | py | @@ -141,31 +141,32 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution]() | py | | 328 | [Odd Even Linked List]() | Medium | | [solution]() | py | | 330 | [Patching Array]() | Hard | Daily | [solution]() | py | -| 339 | [Nested List Weight Sum]() | Medium | | [solution]() | c, py | +| 339 | [Nested List Weight Sum]() | Medium | | [solution]() | py, c | | 341 | [Flatten Nested List Iterator]() | Medium | | [solution]() | java | -| 344 | [Reverse String]() | Easy | Daily | [solution]() | java, py | +| 344 | [Reverse String]() | Easy | Daily | [solution]() | py, java | | 345 | [Reverse Vowels of a String]() | Easy | | [solution]() | py | | 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution]() | py | | 348 | [Design Tic-Tac-Toe]() | Medium | | [solution]() | py | -| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution]() | java, py | +| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution]() | py, java | | 353 | [Design Snake Game]() | Medium | | [solution]() | py | -| 364 | [Nested List Weight Sum II]() | Medium | | [solution]() | java, py | +| 364 | [Nested List Weight Sum II]() | Medium | | [solution]() | py, java | | 366 | [Find Leaves of Binary Tree]() | Medium | | [solution]() | py | | 369 | [Plus One Linked List]() | Medium | | [solution]() | c | -| 374 | [Guess Number Higher or Lower]() | Easy | | [solution]() | java, py | -| 382 | [Linked List Random Node]() | Medium | | [solution]() | c, java, py | +| 374 | [Guess Number Higher or Lower]() | Easy | | [solution]() | py, java | +| 382 | [Linked List Random Node]() | Medium | | [solution]() | py, java, c | | 384 | [Shuffle an Array]() | Medium | | [solution]() | py | | 392 | [Is Subsequence]() | Easy | | [solution]() | java | | 394 | [Decode String]() | Medium | | [solution]() | py | | 408 | [Valid Word Abbreviation]() | Easy | | [solution]() | py | -| 409 | [Longest Palindrome]() | Easy | Daily | [solution]() | c, py | -| 412 | [Fizz Buzz]() | Easy | | [solution]() | java, py | +| 409 | [Longest Palindrome]() | Easy | Daily | [solution]() | py, c | +| 412 | [Fizz Buzz]() | Easy | | [solution]() | py, java | | 414 | [Third Maximum Number]() | Easy | | [solution]() | py | -| 419 | [Battleships in a Board]() | Medium | | [solution]() | c, py | +| 419 | [Battleships in a Board]() | Medium | | [solution]() | py, c | +| 424 | [Longest Repeating Character Replacement]() | Medium | N150, B75 | [solution]() | py | | 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution]() | py | | 429 | [N-ary Tree Level Order Traversal]() | Medium | | [solution]() | py | | 430 | [Flatten a Multilevel Doubly Linked List]() | Medium | | [solution]() | java, cpp | -| 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution]() | java, py | +| 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution]() | py, java | | 437 | [Path Sum III]() | Medium | | [solution]() | py | | 450 | [Delete Node in a BST]() | Medium | | [solution]() | py | | 451 | [Sort Characters By Frequency]() | Medium | | [solution]() | py | @@ -178,7 +179,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 535 | [Encode and Decode TinyURL]() | Medium | | [solution]() | py | | 540 | [Single Element in a Sorted Array]() | Medium | | [solution]() | py | | 542 | [01 Matrix]() | Medium | | [solution]() | py | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution]() | c, java, py | +| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution]() | py, java, c | | 565 | [Array Nesting]() | Medium | | [solution]() | py | | 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution]() | py | | 577 | [Employee Bonus]() | Easy | | [solution]() | sql | @@ -191,13 +192,13 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 616 | [Add Bold Tag in String]() | Medium | | [solution]() | py | | 619 | [Biggest Single Number]() | Easy | | [solution]() | sql | | 637 | [Average of Levels in Binary Tree]() | Easy | | [solution]() | py | -| 645 | [Set Mismatch]() | Easy | | [solution]() | java, py | +| 645 | [Set Mismatch]() | Easy | | [solution]() | py, java | | 647 | [Palindromic Substrings]() | Medium | N150, B75 | [solution]() | py | -| 648 | [Replace Words]() | Medium | Daily | [solution]() | java, py | +| 648 | [Replace Words]() | Medium | Daily | [solution]() | py, java | | 651 | [4 Keys Keyboard]() | Medium | | [solution]() | py | | 654 | [Maximum Binary Tree]() | Medium | | [solution]() | py | | 663 | [Equal Tree Partition]() | Medium | Daily | [solution]() | py | -| 665 | [Non-decreasing Array]() | Medium | | [solution]() | java, py | +| 665 | [Non-decreasing Array]() | Medium | | [solution]() | py, java | | 666 | [Path Sum IV]() | Medium | | [solution]() | py | | 676 | [Implement Magic Dictionary]() | Medium | | [solution]() | py | | 687 | [Longest Univalue Path]() | Medium | | [solution]() | py | @@ -210,11 +211,11 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 713 | [Subarray Product Less Than K]() | Medium | | [solution]() | py | | 720 | [Longest Word in Dictionary]() | Medium | | [solution]() | py | | 725 | [Split Linked List in Parts]() | Medium | | [solution]() | py | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution]() | c, java, py | -| 744 | [Find Smallest Letter Greater Than Target]() | Easy | | [solution]() | java, py | +| 739 | [Daily Temperatures]() | Medium | N150 | [solution]() | py, java, c | +| 744 | [Find Smallest Letter Greater Than Target]() | Easy | | [solution]() | py, java | | 746 | [Min Cost Climbing Stairs]() | Easy | N150 | [solution]() | py | | 758 | [Bold Words in String]() | Medium | | [solution]() | py | -| 771 | [Jewels and Stones]() | Easy | | [solution]() | java, py | +| 771 | [Jewels and Stones]() | Easy | | [solution]() | py, java | | 776 | [Split BST]() | Medium | Weekly Premium | [solution]() | py | | 784 | [Letter Case Permutation]() | Medium | | [solution]() | py | | 791 | [Custom Sort String]() | Medium | | [solution]() | java | @@ -222,32 +223,32 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution]() | java | | 817 | [Linked List Components]() | Medium | | [solution]() | java | | 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution]() | py | -| 846 | [Hand of Straights]() | Medium | Daily, N150 | [solution]() | py | +| 846 | [Hand of Straights]() | Medium | N150, Daily | [solution]() | py | | 848 | [Shifting Letters]() | Medium | | [solution]() | py | | 849 | [Maximize Distance to Closest Person]() | Medium | | [solution]() | py | | 853 | [Car Fleet]() | Medium | N150 | [solution]() | py | | 856 | [Score of Parentheses]() | Medium | | [solution]() | py | -| 861 | [Score After Flipping Matrix]() | Medium | | [solution]() | c, py | +| 861 | [Score After Flipping Matrix]() | Medium | | [solution]() | py, c | | 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution]() | py | | 867 | [Transpose Matrix]() | Easy | | [solution]() | py | | 890 | [Find and Replace Pattern]() | Medium | | [solution]() | py | | 909 | [Snakes and Ladders]() | Medium | | [solution]() | py | | 919 | [Complete Binary Tree Inserter]() | Medium | | [solution]() | py | -| 921 | [Minimum Add to Make Parentheses Valid]() | Medium | | [solution]() | java, py | +| 921 | [Minimum Add to Make Parentheses Valid]() | Medium | | [solution]() | py, java | | 930 | [Binary Subarrays With Sum]() | Medium | | [solution]() | py | | 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution]() | py | -| 946 | [Validate Stack Sequences]() | Medium | | [solution]() | c, py | +| 946 | [Validate Stack Sequences]() | Medium | | [solution]() | py, c | | 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution]() | py | | 973 | [K Closest Points to Origin]() | Medium | N150 | [solution]() | py | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution]() | java, py | +| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution]() | py, java | | 977 | [Squares of a Sorted Array]() | Easy | | [solution]() | py | | 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution]() | py | | 993 | [Cousins in Binary Tree]() | Easy | | [solution]() | py | | 994 | [Rotting Oranges]() | Medium | N150 | [solution]() | py | -| 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution]() | c, py | +| 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution]() | py, c | | 1002 | [Find Common Characters]() | Easy | Daily | [solution]() | py | -| 1006 | [Clumsy Factorial]() | Medium | | [solution]() | c, py | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution]() | c, java, cpp | +| 1006 | [Clumsy Factorial]() | Medium | | [solution]() | py, c | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution]() | cpp, java, c | | 1018 | [Binary Prefix Divisible By 5]() | Easy | | [solution]() | py | | 1019 | [Next Greater Node In Linked List]() | Medium | | [solution]() | py | | 1020 | [Number of Enclaves]() | Medium | | [solution]() | py | @@ -256,12 +257,12 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution]() | py | | 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution]() | c | | 1046 | [Last Stone Weight]() | Easy | N150 | [solution]() | py | -| 1051 | [Height Checker]() | Easy | Daily | [solution]() | c, py | +| 1051 | [Height Checker]() | Easy | Daily | [solution]() | py, c | | 1052 | [Grumpy Bookstore Owner]() | Medium | Daily | [solution]() | py | | 1068 | [Product Sales Analysis I]() | Easy | | [solution]() | sql | | 1087 | [Brace Expansion]() | Medium | | [solution]() | py | | 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution]() | py | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution]() | java, py | +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution]() | py, java | | 1166 | [Design File System]() | Medium | | [solution]() | py | | 1171 | [Remove Zero Sum Consecutive Nodes from Linked List]() | Medium | | [solution]() | py | | 1184 | [Distance Between Bus Stops]() | Easy | | [solution]() | py | @@ -274,15 +275,15 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 1252 | [Cells with Odd Values in a Matrix]() | Easy | | [solution]() | c | | 1254 | [Number of Closed Islands]() | Medium | | [solution]() | py | | 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution]() | py | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution]() | c, py | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution]() | py, c | | 1268 | [Search Suggestions System]() | Medium | | [solution]() | py | | 1282 | [Group the People Given the Group Size They Belong To]() | Medium | | [solution]() | py | | 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix]() | Hard | | [solution]() | py | -| 1302 | [Deepest Leaves Sum]() | Medium | | [solution]() | c, py | +| 1302 | [Deepest Leaves Sum]() | Medium | | [solution]() | py, c | | 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution]() | java | | 1315 | [Sum of Nodes with Even-Valued Grandparent]() | Medium | | [solution]() | py | | 1317 | [Convert Integer to the Sum of Two No-Zero Integers]() | Easy | | [solution]() | c | -| 1351 | [Count Negative Numbers in a Sorted Matrix]() | Easy | | [solution]() | java, py | +| 1351 | [Count Negative Numbers in a Sorted Matrix]() | Easy | | [solution]() | py, java | | 1372 | [Longest ZigZag Path in a Binary Tree]() | Medium | | [solution]() | py | | 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution]() | py | | 1404 | [Number of Steps to Reduce a Number in Binary Representation to One]() | Medium | Daily | [solution]() | py | @@ -295,92 +296,92 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Medium | | [solution]() | py | | 1460 | [Make Two Arrays Equal by Reversing Subarrays]() | Easy | | [solution]() | c | | 1470 | [Shuffle the Array]() | Easy | | [solution]() | c | -| 1474 | [Delete N Nodes After M Nodes of a Linked List]() | Easy | | [solution]() | c, java | +| 1474 | [Delete N Nodes After M Nodes of a Linked List]() | Easy | | [solution]() | java, c | | 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution]() | py | | 1482 | [Minimum Number of Days to Make m Bouquets]() | Medium | | [solution]() | py | -| 1490 | [Clone N-ary Tree]() | Medium | | [solution]() | java, py | -| 1502 | [Can Make Arithmetic Progression From Sequence]() | Easy | | [solution]() | c, py | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution]() | c, java, py, cpp | +| 1490 | [Clone N-ary Tree]() | Medium | | [solution]() | py, java | +| 1502 | [Can Make Arithmetic Progression From Sequence]() | Easy | | [solution]() | py, c | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution]() | py, cpp, java, c | | 1522 | [Diameter of N-Ary Tree]() | Medium | | [solution]() | py | | 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution]() | py | | 1535 | [Find the Winner of an Array Game]() | Medium | | [solution]() | py | -| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution]() | c, py | -| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution]() | kt, java, c, rb, py, rs, js | +| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution]() | py, c | +| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution]() | py, rs, java, rb, js, c, kt | | 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution]() | py | | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution]() | py | | 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution]() | py | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution]() | c, java, py | +| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution]() | py, java, c | | 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable]() | Hard | Daily | [solution]() | py | | 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution]() | py | -| 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution]() | java, py | +| 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution]() | py, java | | 1609 | [Even Odd Tree]() | Medium | | [solution]() | py | -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution]() | c, java, cpp | +| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution]() | cpp, java, c | | 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution]() | py | | 1660 | [Correct a Binary Tree]() | Medium | | [solution]() | py | | 1669 | [Merge In Between Linked Lists]() | Medium | | [solution]() | c | | 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Medium | | [solution]() | py | -| 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution]() | c, py | -| 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers]() | Medium | | [solution]() | c, java | -| 1696 | [Jump Game VI]() | Medium | | [solution]() | java, py | -| 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution]() | java, py | +| 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution]() | py, c | +| 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers]() | Medium | | [solution]() | java, c | +| 1696 | [Jump Game VI]() | Medium | | [solution]() | py, java | +| 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution]() | py, java | | 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution]() | py | | 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution]() | c | | 1730 | [Shortest Path to Get Food]() | Medium | | [solution]() | py | | 1736 | [Latest Time by Replacing Hidden Digits]() | Easy | | [solution](