From 89f7be34e893b49df602e31279f8056d06c8a28f Mon Sep 17 00:00:00 2001 From: Zanger67/leetcode Date: Sun, 21 Jul 2024 06:52:55 +0000 Subject: [PATCH] Updated markdown files --- .readme_updater | 2 +- README.md | 582 ++++++++++---------- markdowns/Daily_Questions.md | 64 +-- markdowns/Easy.md | 565 +++++-------------- markdowns/Medium.md | 295 +++++++++- markdowns/Questions_By_Code_Length.md | 582 ++++++++++---------- markdowns/Questions_By_Recent.md | 582 ++++++++++---------- markdowns/by_topic/Array.md | 276 +++++----- markdowns/by_topic/Backtracking.md | 26 +- markdowns/by_topic/Binary Search Tree.md | 22 +- markdowns/by_topic/Binary Search.md | 24 +- markdowns/by_topic/Binary Tree.md | 102 ++-- markdowns/by_topic/Bit Manipulation.md | 36 +- markdowns/by_topic/Brainteaser.md | 2 +- markdowns/by_topic/Breadth-First Search.md | 76 +-- markdowns/by_topic/Bucket Sort.md | 6 +- markdowns/by_topic/Combinatorics.md | 6 +- markdowns/by_topic/Counting.md | 26 +- markdowns/by_topic/Data Stream.md | 2 +- markdowns/by_topic/Database.md | 8 +- markdowns/by_topic/Depth-First Search.md | 116 ++-- markdowns/by_topic/Design.md | 44 +- markdowns/by_topic/Divide and Conquer.md | 8 +- markdowns/by_topic/Doubly-Linked List.md | 6 +- markdowns/by_topic/Dynamic Programming.md | 36 +- markdowns/by_topic/Game Theory.md | 4 +- markdowns/by_topic/Geometry.md | 2 +- markdowns/by_topic/Graph.md | 8 +- markdowns/by_topic/Greedy.md | 54 +- markdowns/by_topic/Hash Function.md | 6 +- markdowns/by_topic/Hash Table.md | 146 ++--- markdowns/by_topic/Heap (Priority Queue).md | 20 +- markdowns/by_topic/Interactive.md | 2 +- markdowns/by_topic/Iterator.md | 6 +- markdowns/by_topic/Linked List.md | 68 +-- markdowns/by_topic/Math.md | 66 +-- markdowns/by_topic/Matrix.md | 54 +- markdowns/by_topic/Monotonic Queue.md | 4 +- markdowns/by_topic/Monotonic Stack.md | 16 +- markdowns/by_topic/Number Theory.md | 2 +- markdowns/by_topic/Ordered Set.md | 2 +- markdowns/by_topic/Prefix Sum.md | 20 +- markdowns/by_topic/Queue.md | 16 +- markdowns/by_topic/Quickselect.md | 4 +- markdowns/by_topic/Randomized.md | 6 +- markdowns/by_topic/Recursion.md | 20 +- markdowns/by_topic/Reservoir Sampling.md | 2 +- markdowns/by_topic/Rolling Hash.md | 4 +- markdowns/by_topic/Shortest Path.md | 2 +- markdowns/by_topic/Simulation.md | 40 +- markdowns/by_topic/Sliding Window.md | 22 +- markdowns/by_topic/Sorting.md | 80 +-- markdowns/by_topic/Stack.md | 70 +-- markdowns/by_topic/String Matching.md | 4 +- markdowns/by_topic/String.md | 126 ++--- markdowns/by_topic/Suffix Array.md | 2 +- markdowns/by_topic/Topological Sort.md | 2 +- markdowns/by_topic/Tree.md | 112 ++-- markdowns/by_topic/Trie.md | 30 +- markdowns/by_topic/Two Pointers.md | 60 +- markdowns/by_topic/Union Find.md | 14 +- 61 files changed, 2296 insertions(+), 2294 deletions(-) diff --git a/.readme_updater b/.readme_updater index b590abc0..4414b278 160000 --- a/.readme_updater +++ b/.readme_updater @@ -1 +1 @@ -Subproject commit b590abc0510469555fdc38e86d157da5fad3a86b +Subproject commit 4414b27821b89805ec795a5dab922ee16fe742fe diff --git a/README.md b/README.md index 70e09226..fb5b5ea5 100644 --- a/README.md +++ b/README.md @@ -39,156 +39,156 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | # | Title | Level | Cats | Solution | Languages | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:-------------------------------------------------------------------------------------------------------------|:---------------------------------| | 1 | [Two Sum]() | Easy | B75, N150 | [solution]() | java, py | -| 2 | [Add Two Numbers]() | Easy | N150 | [solution]() | java | -| 3 | [Longest Substring Without Repeating Characters]() | Easy | B75, N150 | [solution]() | java | -| 5 | [Longest Palindromic Substring]() | Easy | B75, N150 | [solution]() | py | -| 7 | [Reverse Integer]() | Easy | N150 | [solution]() | py | -| 8 | [String to Integer (atoi)]() | Easy | | [solution]() | py | +| 2 | [Add Two Numbers]() | Medium | N150 | [solution]() | java | +| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution]() | java | +| 5 | [Longest Palindromic Substring]() | Medium | B75, N150 | [solution]() | py | +| 7 | [Reverse Integer]() | Medium | N150 | [solution]() | py | +| 8 | [String to Integer (atoi)]() | Medium | | [solution]() | py | | 9 | [Palindrome Number]() | Easy | | [solution]() | java | | 14 | [Longest Common Prefix]() | Easy | | [solution]() | java | -| 17 | [Letter Combinations of a Phone Number]() | Easy | N150 | [solution]() | java | -| 19 | [Remove Nth Node From End of List]() | Easy | B75, N150 | [solution]() | c, java, py | +| 17 | [Letter Combinations of a Phone Number]() | Medium | N150 | [solution]() | java | +| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution]() | c, java, py | | 20 | [Valid Parentheses]() | Easy | B75, N150 | [solution]() | java | | 21 | [Merge Two Sorted Lists]() | Easy | B75, N150 | [solution]() | java | -| 22 | [Generate Parentheses]() | Easy | N150 | [solution]() | py | +| 22 | [Generate Parentheses]() | Medium | N150 | [solution]() | py | | 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution]() | py | -| 24 | [Swap Nodes in Pairs]() | Easy | | [solution]() | c | +| 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 | | 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution]() | py | -| 36 | [Valid Sudoku]() | Easy | N150 | [solution]() | py | -| 39 | [Combination Sum]() | Easy | B75, N150 | [solution]() | py | -| 46 | [Permutations]() | Easy | N150 | [solution]() | py | -| 48 | [Rotate Image]() | Easy | B75, N150 | [solution]() | c, py | -| 49 | [Group Anagrams]() | Easy | B75, N150 | [solution]() | py | -| 50 | [Pow(x, n)]() | Easy | N150 | [solution]() | c, java, py | -| 56 | [Merge Intervals]() | Easy | B75, N150 | [solution]() | py | -| 57 | [Insert Interval]() | Easy | B75, N150 | [solution]() | py | -| 61 | [Rotate List]() | Easy | | [solution]() | py | +| 36 | [Valid Sudoku]() | Medium | N150 | [solution]() | py | +| 39 | [Combination Sum]() | Medium | B75, N150 | [solution]() | py | +| 46 | [Permutations]() | Medium | N150 | [solution]() | py | +| 48 | [Rotate Image]() | Medium | B75, N150 | [solution]() | c, py | +| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution]() | py | +| 50 | [Pow(x, n)]() | Medium | N150 | [solution]() | c, java, py | +| 56 | [Merge Intervals]() | Medium | B75, N150 | [solution]() | py | +| 57 | [Insert Interval]() | Medium | B75, N150 | [solution]() | py | +| 61 | [Rotate List]() | Medium | | [solution]() | py | | 66 | [Plus One]() | Easy | N150 | [solution]() | c | | 69 | [Sqrt(x)]() | Easy | | [solution]() | py | | 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution]() | py | -| 71 | [Simplify Path]() | Easy | | [solution]() | py | -| 74 | [Search a 2D Matrix]() | Easy | N150 | [solution]() | py | -| 75 | [Sort Colors]() | Easy | Daily | [solution]() | c, py | -| 77 | [Combinations]() | Easy | | [solution]() | py | -| 78 | [Subsets]() | Easy | N150 | [solution]() | py | -| 79 | [Word Search]() | Easy | B75, N150 | [solution]() | py | -| 82 | [Remove Duplicates from Sorted List II]() | Easy | | [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 | +| 77 | [Combinations]() | Medium | | [solution]() | py | +| 78 | [Subsets]() | Medium | N150 | [solution]() | py | +| 79 | [Word Search]() | Medium | B75, N150 | [solution]() | py | +| 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution]() | py | | 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution]() | py | -| 90 | [Subsets II]() | Easy | N150 | [solution]() | py | +| 90 | [Subsets II]() | Medium | N150 | [solution]() | py | | 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution]() | java, py | -| 98 | [Validate Binary Search Tree]() | Easy | B75, N150 | [solution]() | c | +| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution]() | c | | 100 | [Same Tree]() | Easy | B75, N150 | [solution]() | py | -| 102 | [Binary Tree Level Order Traversal]() | Easy | B75, N150 | [solution]() | java | -| 103 | [Binary Tree Zigzag Level Order Traversal]() | Easy | | [solution]() | py | +| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution]() | java | +| 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution]() | py | | 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution]() | py | -| 107 | [Binary Tree Level Order Traversal II]() | Easy | | [solution]() | java | +| 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 | | 112 | [Path Sum]() | Easy | | [solution]() | py | -| 113 | [Path Sum II]() | Easy | | [solution]() | py | -| 114 | [Flatten Binary Tree to Linked List]() | Easy | | [solution]() | c, py | +| 113 | [Path Sum II]() | Medium | | [solution]() | py | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution]() | c, py | | 118 | [Pascal's Triangle]() | Easy | | [solution]() | py | | 121 | [Best Time to Buy and Sell Stock]() | Easy | B75, N150 | [solution]() | py | | 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution]() | py | | 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution]() | c, py | -| 128 | [Longest Consecutive Sequence]() | Easy | B75, N150 | [solution]() | java, py | -| 129 | [Sum Root to Leaf Numbers]() | Easy | | [solution]() | py | +| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution]() | java, py | +| 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution]() | py | | 136 | [Single Number]() | Easy | N150 | [solution]() | py | -| 138 | [Copy List with Random Pointer]() | Easy | N150 | [solution]() | py | +| 138 | [Copy List with Random Pointer]() | Medium | N150 | [solution]() | py | | 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution]() | c, py | -| 142 | [Linked List Cycle II]() | Easy | | [solution]() | py | -| 143 | [Reorder List]() | Easy | B75, N150 | [solution]() | java, py | -| 150 | [Evaluate Reverse Polish Notation]() | Easy | N150 | [solution]() | py | -| 155 | [Min Stack]() | Easy | N150 | [solution]() | py | -| 165 | [Compare Version Numbers]() | Easy | | [solution]() | c, py | -| 166 | [Fraction to Recurring Decimal]() | Easy | | [solution]() | py | -| 167 | [Two Sum II - Input Array Is Sorted]() | Easy | N150 | [solution]() | py | -| 173 | [Binary Search Tree Iterator]() | Easy | | [solution]() | py | +| 142 | [Linked List Cycle II]() | Medium | | [solution]() | py | +| 143 | [Reorder List]() | Medium | B75, N150 | [solution]() | java, py | +| 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution]() | py | +| 155 | [Min Stack]() | Medium | N150 | [solution]() | py | +| 165 | [Compare Version Numbers]() | Medium | | [solution]() | c, py | +| 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 | | 175 | [Combine Two Tables]() | Easy | | [solution]() | py, sql | -| 176 | [Second Highest Salary]() | Easy | | [solution]() | sql | -| 177 | [Nth Highest Salary]() | Easy | | [solution]() | sql | +| 176 | [Second Highest Salary]() | Medium | | [solution]() | sql | +| 177 | [Nth Highest Salary]() | Medium | | [solution]() | sql | | 181 | [Employees Earning More Than Their Managers]() | Easy | | [solution]() | sql | | 182 | [Duplicate Emails]() | Easy | | [solution]() | sql | | 183 | [Customers Who Never Order]() | Easy | | [solution]() | sql | -| 184 | [Department Highest Salary]() | Easy | | [solution]() | sql | -| 189 | [Rotate Array]() | Easy | | [solution]() | py | +| 184 | [Department Highest Salary]() | Medium | | [solution]() | sql | +| 189 | [Rotate Array]() | Medium | | [solution]() | py | | 191 | [Number of 1 Bits]() | Easy | B75, N150 | [solution]() | py | | 196 | [Delete Duplicate Emails]() | Easy | | [solution]() | py, sql | | 197 | [Rising Temperature]() | Easy | | [solution]() | sql | -| 198 | [House Robber]() | Easy | B75, N150 | [solution]() | py | -| 199 | [Binary Tree Right Side View]() | Easy | N150 | [solution]() | cpp, java | -| 200 | [Number of Islands]() | Easy | B75, N150 | [solution]() | py | +| 198 | [House Robber]() | Medium | B75, N150 | [solution]() | py | +| 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution]() | cpp, java | +| 200 | [Number of Islands]() | Medium | B75, N150 | [solution]() | py | | 206 | [Reverse Linked List]() | Easy | B75, N150 | [solution]() | java | -| 208 | [Implement Trie (Prefix Tree)]() | Easy | B75, N150 | [solution]() | py | -| 211 | [Design Add and Search Words Data Structure]() | Easy | B75, N150 | [solution]() | py | +| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution]() | py | +| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution]() | py | | 212 | [Word Search II]() | Hard | B75, N150 | [solution]() | py | | 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution]() | py | | 224 | [Basic Calculator]() | Hard | | [solution]() | py | | 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution]() | py | -| 227 | [Basic Calculator II]() | Easy | | [solution]() | py | -| 230 | [Kth Smallest Element in a BST]() | Easy | B75, N150 | [solution]() | py | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Easy | B75, N150 | [solution]() | py | -| 236 | [Lowest Common Ancestor of a Binary Tree]() | Easy | B75 | [solution]() | py | -| 238 | [Product of Array Except Self]() | Easy | B75, N150 | [solution]() | py | +| 227 | [Basic Calculator II]() | Medium | | [solution]() | py | +| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution]() | py | +| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution]() | py | +| 236 | [Lowest Common Ancestor of a Binary Tree]() | Medium | B75 | [solution]() | py | +| 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution]() | py | | 239 | [Sliding Window Maximum]() | Hard | N150 | [solution]() | py | | 242 | [Valid Anagram]() | Easy | B75, N150 | [solution]() | c, py | -| 251 | [Flatten 2D Vector]() | Easy | | [solution]() | py | -| 260 | [Single Number III]() | Easy | Daily | [solution]() | py | -| 271 | [Encode and Decode Strings]() | Easy | B75, N150 | [solution]() | py | +| 251 | [Flatten 2D Vector]() | Medium | | [solution]() | py | +| 260 | [Single Number III]() | Medium | Daily | [solution]() | py | +| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution]() | py | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution]() | py | | 273 | [Integer to English Words]() | Hard | | [solution]() | py | -| 286 | [Walls and Gates]() | Easy | N150 | [solution]() | py | -| 287 | [Find the Duplicate Number]() | Easy | N150 | [solution]() | c | +| 286 | [Walls and Gates]() | Medium | N150 | [solution]() | py | +| 287 | [Find the Duplicate Number]() | Medium | N150 | [solution]() | c | | 292 | [Nim Game]() | Easy | | [solution]() | py | -| 314 | [Binary Tree Vertical Order Traversal]() | Easy | | [solution]() | py | -| 328 | [Odd Even Linked List]() | Easy | | [solution]() | py | +| 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]() | Easy | | [solution]() | c, py | -| 341 | [Flatten Nested List Iterator]() | Easy | | [solution]() | java | +| 339 | [Nested List Weight Sum]() | Medium | | [solution]() | c, py | +| 341 | [Flatten Nested List Iterator]() | Medium | | [solution]() | java | | 344 | [Reverse String]() | Easy | Daily | [solution]() | java, py | | 345 | [Reverse Vowels of a String]() | Easy | | [solution]() | py | -| 347 | [Top K Frequent Elements]() | Easy | B75, N150 | [solution]() | py | -| 348 | [Design Tic-Tac-Toe]() | Easy | | [solution]() | py | +| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution]() | py | +| 348 | [Design Tic-Tac-Toe]() | Medium | | [solution]() | py | | 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution]() | java, py | -| 353 | [Design Snake Game]() | Easy | | [solution]() | py | -| 364 | [Nested List Weight Sum II]() | Easy | | [solution]() | java, py | -| 366 | [Find Leaves of Binary Tree]() | Easy | | [solution]() | py | -| 369 | [Plus One Linked List]() | Easy | | [solution]() | c | +| 353 | [Design Snake Game]() | Medium | | [solution]() | py | +| 364 | [Nested List Weight Sum II]() | Medium | | [solution]() | java, py | +| 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 | -| 380 | [Insert Delete GetRandom O(1)]() | Easy | | [solution]() | java | +| 380 | [Insert Delete GetRandom O(1)]() | Medium | | [solution]() | java | | 381 | [Insert Delete GetRandom O(1) - Duplicates allowed]() | Hard | | [solution]() | java | -| 382 | [Linked List Random Node]() | Easy | | [solution]() | c, java, py | -| 384 | [Shuffle an Array]() | Easy | | [solution]() | py | +| 382 | [Linked List Random Node]() | Medium | | [solution]() | c, java, py | +| 384 | [Shuffle an Array]() | Medium | | [solution]() | py | | 392 | [Is Subsequence]() | Easy | | [solution]() | java | -| 394 | [Decode String]() | Easy | | [solution]() | py | +| 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 | | 414 | [Third Maximum Number]() | Easy | | [solution]() | py | -| 419 | [Battleships in a Board]() | Easy | | [solution]() | c, py | -| 424 | [Longest Repeating Character Replacement]() | Easy | B75, N150 | [solution]() | py | -| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Easy | | [solution]() | py | -| 429 | [N-ary Tree Level Order Traversal]() | Easy | | [solution]() | py | -| 430 | [Flatten a Multilevel Doubly Linked List]() | Easy | | [solution]() | cpp, java | +| 419 | [Battleships in a Board]() | Medium | | [solution]() | c, py | +| 424 | [Longest Repeating Character Replacement]() | Medium | B75, N150 | [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]() | cpp, java | | 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution]() | java, py | -| 437 | [Path Sum III]() | Easy | | [solution]() | py | -| 450 | [Delete Node in a BST]() | Easy | | [solution]() | py | -| 451 | [Sort Characters By Frequency]() | Easy | | [solution]() | py | -| 475 | [Heaters]() | Easy | | [solution]() | py | +| 437 | [Path Sum III]() | Medium | | [solution]() | py | +| 450 | [Delete Node in a BST]() | Medium | | [solution]() | py | +| 451 | [Sort Characters By Frequency]() | Medium | | [solution]() | py | +| 475 | [Heaters]() | Medium | | [solution]() | py | | 502 | [IPO]() | Hard | Daily | [solution]() | py | -| 503 | [Next Greater Element II]() | Easy | | [solution]() | py | +| 503 | [Next Greater Element II]() | Medium | | [solution]() | py | | 509 | [Fibonacci Number]() | Easy | | [solution]() | c | -| 513 | [Find Bottom Left Tree Value]() | Easy | | [solution]() | java | -| 523 | [Continuous Subarray Sum]() | Easy | Daily | [solution]() | py | -| 535 | [Encode and Decode TinyURL]() | Easy | | [solution]() | py | -| 540 | [Single Element in a Sorted Array]() | Easy | | [solution]() | py | -| 542 | [01 Matrix]() | Easy | | [solution]() | py | +| 513 | [Find Bottom Left Tree Value]() | Medium | | [solution]() | java | +| 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution]() | py | +| 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 | -| 565 | [Array Nesting]() | Easy | | [solution]() | py | -| 567 | [Permutation in String]() | Easy | N150 | [solution]() | py | +| 565 | [Array Nesting]() | Medium | | [solution]() | py | +| 567 | [Permutation in String]() | Medium | N150 | [solution]() | py | | 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution]() | py | | 577 | [Employee Bonus]() | Easy | | [solution]() | sql | | 584 | [Find Customer Referee]() | Easy | | [solution]() | sql | @@ -196,244 +196,244 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 595 | [Big Countries]() | Easy | | [solution]() | sql | | 596 | [Classes More Than 5 Students]() | Easy | | [solution]() | sql | | 607 | [Sales Person]() | Easy | | [solution]() | sql | -| 611 | [Valid Triangle Number]() | Easy | | [solution]() | py | -| 616 | [Add Bold Tag in String]() | Easy | | [solution]() | py | +| 611 | [Valid Triangle Number]() | Medium | | [solution]() | py | +| 616 | [Add Bold Tag in String]() | Medium | | [solution]() | py | | 619 | [Biggest Single Number]() | Easy | | [solution]() | sql | -| 622 | [Design Circular Queue]() | Easy | | [solution]() | py | +| 622 | [Design Circular Queue]() | Medium | | [solution]() | py | | 637 | [Average of Levels in Binary Tree]() | Easy | | [solution]() | py | | 645 | [Set Mismatch]() | Easy | | [solution]() | java, py | -| 647 | [Palindromic Substrings]() | Easy | B75, N150 | [solution]() | py | -| 648 | [Replace Words]() | Easy | Daily | [solution]() | java, py | -| 651 | [4 Keys Keyboard]() | Easy | | [solution]() | py | -| 654 | [Maximum Binary Tree]() | Easy | | [solution]() | py | -| 663 | [Equal Tree Partition]() | Easy | Daily | [solution]() | py | -| 665 | [Non-decreasing Array]() | Easy | | [solution]() | java, py | -| 666 | [Path Sum IV]() | Easy | | [solution]() | py | -| 676 | [Implement Magic Dictionary]() | Easy | | [solution]() | py | -| 687 | [Longest Univalue Path]() | Easy | | [solution]() | py | -| 690 | [Employee Importance]() | Easy | | [solution]() | java | -| 692 | [Top K Frequent Words]() | Easy | | [solution]() | py | -| 695 | [Max Area of Island]() | Easy | N150 | [solution]() | c | +| 647 | [Palindromic Substrings]() | Medium | B75, N150 | [solution]() | py | +| 648 | [Replace Words]() | Medium | Daily | [solution]() | java, py | +| 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 | +| 666 | [Path Sum IV]() | Medium | | [solution]() | py | +| 676 | [Implement Magic Dictionary]() | Medium | | [solution]() | py | +| 687 | [Longest Univalue Path]() | Medium | | [solution]() | py | +| 690 | [Employee Importance]() | Medium | | [solution]() | java | +| 692 | [Top K Frequent Words]() | Medium | | [solution]() | py | +| 695 | [Max Area of Island]() | Medium | N150 | [solution]() | c | | 700 | [Search in a Binary Search Tree]() | Easy | | [solution]() | c, java, py | | 703 | [Kth Largest Element in a Stream]() | Easy | N150 | [solution]() | py | -| 707 | [Design Linked List]() | Easy | | [solution]() | java | -| 708 | [Insert into a Sorted Circular Linked List]() | Easy | | [solution]() | py | -| 713 | [Subarray Product Less Than K]() | Easy | | [solution]() | py | -| 720 | [Longest Word in Dictionary]() | Easy | | [solution]() | py | -| 725 | [Split Linked List in Parts]() | Easy | | [solution]() | py | +| 707 | [Design Linked List]() | Medium | | [solution]() | java | +| 708 | [Insert into a Sorted Circular Linked List]() | Medium | | [solution]() | py | +| 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 | | 726 | [Number of Atoms]() | Hard | Daily | [solution]() | py | -| 735 | [Asteroid Collision]() | Easy | | [solution]() | py | -| 739 | [Daily Temperatures]() | Easy | N150 | [solution]() | c, java, py | +| 735 | [Asteroid Collision]() | Medium | | [solution]() | py | +| 739 | [Daily Temperatures]() | Medium | N150 | [solution]() | c, java, py | | 744 | [Find Smallest Letter Greater Than Target]() | Easy | | [solution]() | java, py | | 746 | [Min Cost Climbing Stairs]() | Easy | N150 | [solution]() | py | -| 758 | [Bold Words in String]() | Easy | | [solution]() | py | +| 758 | [Bold Words in String]() | Medium | | [solution]() | py | | 771 | [Jewels and Stones]() | Easy | | [solution]() | java, py | -| 776 | [Split BST]() | Easy | Weekly Premium | [solution]() | py | -| 784 | [Letter Case Permutation]() | Easy | | [solution]() | py | -| 791 | [Custom Sort String]() | Easy | | [solution]() | java | -| 794 | [Valid Tic-Tac-Toe State]() | Easy | | [solution]() | py | -| 807 | [Max Increase to Keep City Skyline]() | Easy | | [solution]() | java | -| 817 | [Linked List Components]() | Easy | | [solution]() | java | -| 826 | [Most Profit Assigning Work]() | Easy | Daily | [solution]() | py | -| 846 | [Hand of Straights]() | Easy | Daily, N150 | [solution]() | py | -| 848 | [Shifting Letters]() | Easy | | [solution]() | py | -| 849 | [Maximize Distance to Closest Person]() | Easy | | [solution]() | py | -| 853 | [Car Fleet]() | Easy | N150 | [solution]() | py | -| 856 | [Score of Parentheses]() | Easy | | [solution]() | py | -| 861 | [Score After Flipping Matrix]() | Easy | | [solution]() | c, py | -| 863 | [All Nodes Distance K in Binary Tree]() | Easy | | [solution]() | py | +| 776 | [Split BST]() | Medium | Weekly Premium | [solution]() | py | +| 784 | [Letter Case Permutation]() | Medium | | [solution]() | py | +| 791 | [Custom Sort String]() | Medium | | [solution]() | java | +| 794 | [Valid Tic-Tac-Toe State]() | Medium | | [solution]() | py | +| 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 | +| 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 | +| 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution]() | py | | 867 | [Transpose Matrix]() | Easy | | [solution]() | py | -| 877 | [Stone Game]() | Easy | | [solution]() | c, cpp, go, java, js, py | -| 890 | [Find and Replace Pattern]() | Easy | | [solution]() | py | +| 877 | [Stone Game]() | Medium | | [solution]() | c, cpp, go, java, js, py | +| 890 | [Find and Replace Pattern]() | Medium | | [solution]() | py | | 895 | [Maximum Frequency Stack]() | Hard | | [solution]() | java, py | -| 909 | [Snakes and Ladders]() | Easy | | [solution]() | py | -| 919 | [Complete Binary Tree Inserter]() | Easy | | [solution]() | py | -| 921 | [Minimum Add to Make Parentheses Valid]() | Easy | | [solution]() | java, py | -| 930 | [Binary Subarrays With Sum]() | Easy | | [solution]() | py | -| 945 | [Minimum Increment to Make Array Unique]() | Easy | Daily | [solution]() | py | -| 946 | [Validate Stack Sequences]() | Easy | | [solution]() | c, py | -| 950 | [Reveal Cards In Increasing Order]() | Easy | | [solution]() | py | -| 973 | [K Closest Points to Origin]() | Easy | N150 | [solution]() | py | -| 974 | [Subarray Sums Divisible by K]() | Easy | Daily | [solution]() | java, 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 | +| 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 | +| 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 | | 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]() | Easy | N150 | [solution]() | py | +| 994 | [Rotting Oranges]() | Medium | N150 | [solution]() | py | | 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution]() | c, py | | 1002 | [Find Common Characters]() | Easy | Daily | [solution]() | py | -| 1006 | [Clumsy Factorial]() | Easy | | [solution]() | c, py | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Easy | | [solution]() | c, cpp, java | +| 1006 | [Clumsy Factorial]() | Medium | | [solution]() | c, py | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution]() | c, cpp, java | | 1018 | [Binary Prefix Divisible By 5]() | Easy | | [solution]() | py | -| 1019 | [Next Greater Node In Linked List]() | Easy | | [solution]() | py | -| 1020 | [Number of Enclaves]() | Easy | | [solution]() | py | -| 1026 | [Maximum Difference Between Node and Ancestor]() | Easy | | [solution]() | py | +| 1019 | [Next Greater Node In Linked List]() | Medium | | [solution]() | py | +| 1020 | [Number of Enclaves]() | Medium | | [solution]() | py | +| 1026 | [Maximum Difference Between Node and Ancestor]() | Medium | | [solution]() | py | | 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution]() | py | | 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution]() | py | -| 1038 | [Binary Search Tree to Greater Sum Tree]() | Easy | Daily | [solution]() | c | +| 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 | -| 1052 | [Grumpy Bookstore Owner]() | Easy | Daily | [solution]() | py | +| 1052 | [Grumpy Bookstore Owner]() | Medium | Daily | [solution]() | py | | 1068 | [Product Sales Analysis I]() | Easy | | [solution]() | sql | -| 1087 | [Brace Expansion]() | Easy | | [solution]() | py | -| 1101 | [The Earliest Moment When Everyone Become Friends]() | Easy | Weekly Premium | [solution]() | py | -| 1110 | [Delete Nodes And Return Forest]() | Easy | Daily | [solution]() | py | +| 1087 | [Brace Expansion]() | Medium | | [solution]() | py | +| 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution]() | py | +| 1110 | [Delete Nodes And Return Forest]() | Medium | Daily | [solution]() | py | | 1122 | [Relative Sort Array]() | Easy | Daily | [solution]() | java, py | -| 1161 | [Maximum Level Sum of a Binary Tree]() | Easy | | [solution]() | py | -| 1166 | [Design File System]() | Easy | | [solution]() | py | -| 1171 | [Remove Zero Sum Consecutive Nodes from Linked List]() | Easy | | [solution]() | py | +| 1161 | [Maximum Level Sum of a Binary Tree]() | Medium | | [solution]() | py | +| 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 | -| 1190 | [Reverse Substrings Between Each Pair of Parentheses]() | Easy | Daily | [solution]() | py | -| 1209 | [Remove All Adjacent Duplicates in String II]() | Easy | | [solution]() | py | -| 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Easy | | [solution]() | py | -| 1233 | [Remove Sub-Folders from the Filesystem]() | Easy | | [solution]() | py | -| 1239 | [Maximum Length of a Concatenated String with Unique Characters]() | Easy | | [solution]() | py | -| 1248 | [Count Number of Nice Subarrays]() | Easy | Daily | [solution]() | py | -| 1249 | [Minimum Remove to Make Valid Parentheses]() | Easy | | [solution]() | py | +| 1190 | [Reverse Substrings Between Each Pair of Parentheses]() | Medium | Daily | [solution]() | py | +| 1209 | [Remove All Adjacent Duplicates in String II]() | Medium | | [solution]() | py | +| 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution]() | py | +| 1233 | [Remove Sub-Folders from the Filesystem]() | Medium | | [solution]() | py | +| 1239 | [Maximum Length of a Concatenated String with Unique Characters]() | Medium | | [solution]() | py | +| 1248 | [Count Number of Nice Subarrays]() | Medium | Daily | [solution]() | py | +| 1249 | [Minimum Remove to Make Valid Parentheses]() | Medium | | [solution]() | py | | 1252 | [Cells with Odd Values in a Matrix]() | Easy | | [solution]() | c | -| 1254 | [Number of Closed Islands]() | Easy | | [solution]() | py | +| 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]() | Easy | | [solution]() | c, py | -| 1268 | [Search Suggestions System]() | Easy | | [solution]() | py | -| 1282 | [Group the People Given the Group Size They Belong To]() | Easy | | [solution]() | py | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution]() | c, py | +| 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]() | Easy | | [solution]() | c, js, py | -| 1305 | [All Elements in Two Binary Search Trees]() | Easy | | [solution]() | java | -| 1315 | [Sum of Nodes with Even-Valued Grandparent]() | Easy | | [solution]() | py | +| 1302 | [Deepest Leaves Sum]() | Medium | | [solution]() | c, js, py | +| 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 | -| 1372 | [Longest ZigZag Path in a Binary Tree]() | Easy | | [solution]() | py | +| 1372 | [Longest ZigZag Path in a Binary Tree]() | Medium | | [solution]() | py | | 1380 | [Lucky Numbers in a Matrix]() | Easy | Daily | [solution]() | js, py | -| 1381 | [Design a Stack With Increment Operation]() | Easy | | [solution]() | py | -| 1382 | [Balance a Binary Search Tree]() | Easy | Daily | [solution]() | py | -| 1404 | [Number of Steps to Reduce a Number in Binary Representation to One]() | Easy | Daily | [solution]() | py | +| 1381 | [Design a Stack With Increment Operation]() | 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 | | 1426 | [Counting Elements]() | Easy | | [solution]() | c | | 1436 | [Destination City]() | Easy | | [solution]() | java | -| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Easy | Daily | [solution]() | java | -| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Easy | Daily | [solution]() | py | -| 1448 | [Count Good Nodes in Binary Tree]() | Easy | N150 | [solution]() | java | +| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution]() | java | +| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution]() | py | +| 1448 | [Count Good Nodes in Binary Tree]() | Medium | N150 | [solution]() | java | | 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution]() | py | -| 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Easy | | [solution]() | py | +| 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Medium | | [solution]() | py | | 1460 | [Make Two Arrays Equal by Reversing Subarrays]() | Easy | | [solution]() | c | -| 1461 | [Check If a String Contains All Binary Codes of Size K]() | Easy | | [solution]() | py | +| 1461 | [Check If a String Contains All Binary Codes of Size K]() | Medium | | [solution]() | py | | 1470 | [Shuffle the Array]() | Easy | | [solution]() | c | -| 1472 | [Design Browser History]() | Easy | | [solution]() | py | +| 1472 | [Design Browser History]() | Medium | | [solution]() | py | | 1474 | [Delete N Nodes After M Nodes of a Linked List]() | Easy | | [solution]() | c, java | -| 1481 | [Least Number of Unique Integers after K Removals]() | Easy | | [solution]() | py | -| 1482 | [Minimum Number of Days to Make m Bouquets]() | Easy | | [solution]() | py | -| 1490 | [Clone N-ary Tree]() | Easy | | [solution]() | java, py | +| 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]() | Easy | Daily | [solution]() | c, cpp, java, py | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution]() | c, cpp, java, py | | 1518 | [Water Bottles]() | Easy | Daily | [solution]() | c, cpp, cs, java, js, py, ts | -| 1522 | [Diameter of N-Ary Tree]() | Easy | | [solution]() | py | -| 1525 | [Number of Good Ways to Split a String]() | Easy | | [solution]() | py | -| 1530 | [Number of Good Leaf Nodes Pairs]() | Easy | Daily | [solution]() | py | -| 1535 | [Find the Winner of an Array Game]() | Easy | | [solution]() | py | +| 1522 | [Diameter of N-Ary Tree]() | Medium | | [solution]() | py | +| 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution]() | py | +| 1530 | [Number of Good Leaf Nodes Pairs]() | Medium | Daily | [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]() | Easy | | [solution]() | c, java, js, kt, py, rb, rs | -| 1552 | [Magnetic Force Between Two Balls]() | Easy | Daily | [solution]() | py | -| 1561 | [Maximum Number of Coins You Can Get]() | Easy | | [solution]() | py | -| 1564 | [Put Boxes Into the Warehouse I]() | Easy | | [solution]() | py | -| 1570 | [Dot Product of Two Sparse Vectors]() | Easy | | [solution]() | c, java, py | +| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution]() | c, java, js, kt, py, rb, rs | +| 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 | | 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable]() | Hard | Daily | [solution]() | py | -| 1580 | [Put Boxes Into the Warehouse II]() | Easy | Weekly Premium | [solution]() | py | +| 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution]() | py | | 1598 | [Crawler Log Folder]() | Easy | Daily | [solution]() | c, js | -| 1602 | [Find Nearest Right Node in Binary Tree]() | Easy | | [solution]() | java, py | -| 1605 | [Find Valid Matrix Given Row and Column Sums]() | Easy | Daily | [solution]() | py | -| 1609 | [Even Odd Tree]() | Easy | | [solution]() | py | -| 1641 | [Count Sorted Vowel Strings]() | Easy | | [solution]() | c, cpp, java | -| 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Easy | | [solution]() | py | -| 1657 | [Determine if Two Strings Are Close]() | Easy | | [solution]() | py | -| 1660 | [Correct a Binary Tree]() | Easy | | [solution]() | py | -| 1669 | [Merge In Between Linked Lists]() | Easy | | [solution]() | c | -| 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Easy | | [solution]() | py | +| 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution]() | java, py | +| 1605 | [Find Valid Matrix Given Row and Column Sums]() | Medium | Daily | [solution]() | py | +| 1609 | [Even Odd Tree]() | Medium | | [solution]() | py | +| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution]() | c, cpp, java | +| 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution]() | py | +| 1657 | [Determine if Two Strings Are Close]() | 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]() | Easy | | [solution]() | c, java | -| 1696 | [Jump Game VI]() | Easy | | [solution]() | java, py | -| 1698 | [Number of Distinct Substrings in a String]() | Easy | | [solution]() | java, 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 | | 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution]() | py | -| 1701 | [Average Waiting Time]() | Easy | Daily | [solution]() | js, py | -| 1717 | [Maximum Score From Removing Substrings]() | Easy | Daily | [solution]() | py | -| 1721 | [Swapping Nodes in a Linked List]() | Easy | | [solution]() | c | -| 1730 | [Shortest Path to Get Food]() | Easy | | [solution]() | py | +| 1701 | [Average Waiting Time]() | Medium | Daily | [solution]() | js, py | +| 1717 | [Maximum Score From Removing Substrings]() | Medium | Daily | [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](