From 5583c2c07ca8c3bb6e1fafdfe1fbf51d9cccd811 Mon Sep 17 00:00:00 2001 From: Zanger67 Date: Thu, 4 Jul 2024 17:26:59 -0700 Subject: [PATCH] Updated with additional needcode questions --- README.md | 143 +++++++++--------- markdowns/Daily_Questions.md | 26 ++-- markdowns/Questions_By_Code_Length.md | 139 ++++++++--------- markdowns/Questions_By_Recent.md | 139 ++++++++--------- markdowns/Topics.md | 8 +- .../_5. Longest Palindromic Substring.md | 97 ++++++++++++ markdowns/_647. Palindromic Substrings.md | 52 +++++++ markdowns/_746. Min Cost Climbing Stairs.md | 36 +++++ markdowns/by_topic/Array.md | 65 ++++---- markdowns/by_topic/Backtracking.md | 6 +- markdowns/by_topic/Binary Search Tree.md | 8 +- markdowns/by_topic/Binary Tree.md | 24 +-- markdowns/by_topic/Bit Manipulation.md | 6 +- markdowns/by_topic/Brainteaser.md | 2 +- markdowns/by_topic/Breadth-First Search.md | 12 +- markdowns/by_topic/Bucket Sort.md | 2 +- markdowns/by_topic/Combinatorics.md | 2 +- markdowns/by_topic/Counting Sort.md | 2 +- markdowns/by_topic/Counting.md | 6 +- markdowns/by_topic/Depth-First Search.md | 28 ++-- markdowns/by_topic/Design.md | 8 +- markdowns/by_topic/Divide and Conquer.md | 6 +- markdowns/by_topic/Dynamic Programming.md | 17 ++- markdowns/by_topic/Graph.md | 6 +- markdowns/by_topic/Greedy.md | 8 +- markdowns/by_topic/Hash Function.md | 2 +- markdowns/by_topic/Hash Table.md | 34 ++--- markdowns/by_topic/Heap (Priority Queue).md | 8 +- markdowns/by_topic/Linked List.md | 18 +-- markdowns/by_topic/Math.md | 14 +- markdowns/by_topic/Matrix.md | 10 +- markdowns/by_topic/Memoization.md | 2 +- markdowns/by_topic/Merge Sort.md | 2 +- 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 | 2 +- markdowns/by_topic/Quickselect.md | 2 +- markdowns/by_topic/Recursion.md | 8 +- markdowns/by_topic/Simulation.md | 2 +- markdowns/by_topic/Sliding Window.md | 4 +- markdowns/by_topic/Sorting.md | 20 +-- markdowns/by_topic/Stack.md | 12 +- markdowns/by_topic/String Matching.md | 2 +- markdowns/by_topic/String.md | 36 ++--- markdowns/by_topic/Topological Sort.md | 2 +- markdowns/by_topic/Tree.md | 24 +-- markdowns/by_topic/Trie.md | 8 +- markdowns/by_topic/Two Pointers.md | 24 +-- markdowns/by_topic/Union Find.md | 4 +- my-submissions/e703 Dual Heap.py | 31 ++++ my-submissions/e746.py | 6 + my-submissions/m5 v1 inefficient.py | 18 +++ my-submissions/m5 v2 much better.py | 28 ++++ my-submissions/m5.md | 13 ++ my-submissions/m647.py | 22 +++ 56 files changed, 769 insertions(+), 449 deletions(-) create mode 100644 markdowns/_5. Longest Palindromic Substring.md create mode 100644 markdowns/_647. Palindromic Substrings.md create mode 100644 markdowns/_746. Min Cost Climbing Stairs.md create mode 100644 my-submissions/e703 Dual Heap.py create mode 100644 my-submissions/e746.py create mode 100644 my-submissions/m5 v1 inefficient.py create mode 100644 my-submissions/m5 v2 much better.py create mode 100644 my-submissions/m5.md create mode 100644 my-submissions/m647.py diff --git a/README.md b/README.md index 025569bb..c04e87b2 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,4 @@ -# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (377 solved) +# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (380 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](), [Hash Table](), [String](), [Depth-First Search](), [Tree](), [Binary Tree](), [Sorting](), [Math](), [Breadth-First Search](), [Two Pointers](), [Linked List](), [Stack](), [Greedy](), [Matrix](), [Simulation](), [Bit Manipulation](), [Database](), [Trie](), [Binary Search](), [Design](), [Dynamic Programming](), [Heap (Priority Queue)](), [Recursion](), [Backtracking](), [Counting](), [Binary Search Tree](), [Prefix Sum](), [Sliding Window](), [Queue](), [Union Find](), [Monotonic Stack](), [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](), [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](), [Math](), [Breadth-First Search](), [Two Pointers](), [Linked List](), [Stack](), [Greedy](), [Matrix](), [Simulation](), [Bit Manipulation](), [Dynamic Programming](), [Database](), [Trie](), [Binary Search](), [Design](), [Heap (Priority Queue)](), [Recursion](), [Backtracking](), [Counting](), [Binary Search Tree](), [Prefix Sum](), [Sliding Window](), [Queue](), [Union Find](), [Monotonic Stack](), [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](), [Bitmask](), [Merge Sort](), [Ordered Set](), [Suffix Array](), [Topological Sort](), [Shortest Path](), [Number Theory](), [Reservoir Sampling]() ------ @@ -37,18 +37,19 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, ## Questions | # | Title | Level | Cats | Solution | Languages | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:-------------------------------------------------------------------------------------------------------------|:---------------------------------| -| 1 | [Two Sum]() | Easy | B75, N150 | [solution]() | java, py | +| 1 | [Two Sum]() | Easy | N150, B75 | [solution]() | java, py | | 2 | [Add Two Numbers]() | Medium | N150 | [solution]() | java | -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution]() | java | +| 3 | [Longest Substring Without Repeating Characters]() | Medium | N150, B75 | [solution]() | java | +| 5 | [Longest Palindromic Substring]() | Medium | N150, B75 | [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 | -| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution]() | py, c, java | -| 20 | [Valid Parentheses]() | Easy | B75, N150 | [solution]() | java | -| 21 | [Merge Two Sorted Lists]() | Easy | B75, N150 | [solution]() | java | +| 19 | [Remove Nth Node From End of List]() | Medium | N150, B75 | [solution]() | c, java, py | +| 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 | -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution]() | py | +| 23 | [Merge k Sorted Lists]() | Hard | N150, B75 | [solution]() | py | | 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 | @@ -56,50 +57,50 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 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 | B75, N150 | [solution]() | c, py | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution]() | py | +| 48 | [Rotate Image]() | Medium | N150, B75 | [solution]() | c, py | +| 49 | [Group Anagrams]() | Medium | N150, B75 | [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 | +| 56 | [Merge Intervals]() | Medium | N150, B75 | [solution]() | py | +| 57 | [Insert Interval]() | Medium | N150, B75 | [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 | +| 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]() | py, c | +| 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 | +| 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 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution]() | c | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution]() | py | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution]() | 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 | | 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution]() | py | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution]() | py | +| 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 | | 112 | [Path Sum]() | Easy | | [solution]() | py | | 113 | [Path Sum II]() | Medium | | [solution]() | py | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution]() | py, c | +| 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]() | Medium | B75, N150 | [solution]() | java, 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 | | 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 | B75, N150 | [solution]() | py, c | +| 141 | [Linked List Cycle]() | Easy | N150, B75 | [solution]() | c, py | | 142 | [Linked List Cycle II]() | Medium | | [solution]() | py | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution]() | java, py | +| 143 | [Reorder List]() | Medium | N150, B75 | [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]() | py, c | +| 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 | @@ -111,27 +112,27 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 183 | [Customers Who Never Order]() | Easy | | [solution]() | sql | | 184 | [Department Highest Salary]() | Medium | | [solution]() | sql | | 189 | [Rotate Array]() | Medium | | [solution]() | py | -| 191 | [Number of 1 Bits]() | Easy | B75, N150 | [solution]() | py | +| 191 | [Number of 1 Bits]() | Easy | N150, B75 | [solution]() | py | | 196 | [Delete Duplicate Emails]() | Easy | | [solution]() | py, sql | | 197 | [Rising Temperature]() | Easy | | [solution]() | sql | | 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution]() | java, cpp | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution]() | py | -| 206 | [Reverse Linked List]() | Easy | B75, N150 | [solution]() | java | -| 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 | +| 200 | [Number of Islands]() | Medium | N150, B75 | [solution]() | py | +| 206 | [Reverse Linked List]() | Easy | N150, B75 | [solution]() | java | +| 208 | [Implement Trie (Prefix Tree)]() | Medium | N150, B75 | [solution]() | py | +| 211 | [Design Add and Search Words Data Structure]() | Medium | N150, B75 | [solution]() | py | +| 212 | [Word Search II]() | Hard | N150, B75 | [solution]() | py | +| 217 | [Contains Duplicate]() | Easy | N150, B75 | [solution]() | py | | 224 | [Basic Calculator]() | Hard | | [solution]() | py | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution]() | py | +| 226 | [Invert Binary Tree]() | Easy | N150, B75 | [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 | -| 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution]() | py | +| 230 | [Kth Smallest Element in a BST]() | Medium | N150, B75 | [solution]() | py | +| 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 | B75, N150 | [solution]() | py, c | +| 242 | [Valid Anagram]() | Easy | N150, B75 | [solution]() | c, 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 | +| 271 | [Encode and Decode Strings]() | Medium | N150, B75 | [solution]() | py | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution]() | py | | 273 | [Integer to English Words]() | Hard | | [solution]() | py | | 286 | [Walls and Gates]() | Medium | N150 | [solution]() | py | @@ -144,7 +145,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 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]() | Medium | B75, N150 | [solution]() | py | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution]() | py | | 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution]() | java, py | | 353 | [Design Snake Game]() | Medium | | [solution]() | py | | 364 | [Nested List Weight Sum II]() | Medium | | [solution]() | java, py | @@ -159,7 +160,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 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]() | Medium | | [solution]() | py, c | +| 419 | [Battleships in a Board]() | Medium | | [solution]() | c, 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 | @@ -174,9 +175,9 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution]() | py | | 535 | [Encode and Decode TinyURL]() | Medium | | [solution]() | py | | 542 | [01 Matrix]() | Medium | | [solution]() | py | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution]() | java, c, py | +| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution]() | c, java, py | | 565 | [Array Nesting]() | Medium | | [solution]() | py | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution]() | py | +| 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution]() | py | | 577 | [Employee Bonus]() | Easy | | [solution]() | sql | | 584 | [Find Customer Referee]() | Easy | | [solution]() | sql | | 586 | [Customer Placing the Largest Number of Orders]() | Easy | | [solution]() | sql | @@ -188,7 +189,8 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 619 | [Biggest Single Number]() | Easy | | [solution]() | sql | | 637 | [Average of Levels in Binary Tree]() | Easy | | [solution]() | py | | 645 | [Set Mismatch]() | Easy | | [solution]() | java, py | -| 648 | [Replace Words]() | Medium | Daily | [solution]() | py, java | +| 647 | [Palindromic Substrings]() | Medium | N150, B75 | [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 | @@ -204,8 +206,9 @@ 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]() | java, c, 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]() | Medium | | [solution]() | py | | 771 | [Jewels and Stones]() | Easy | | [solution]() | java, py | | 776 | [Split BST]() | Medium | Weekly Premium | [solution]() | py | @@ -230,7 +233,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 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]() | py, java | +| 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 | @@ -238,7 +241,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution]() | c, py | | 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]() | java, cpp, c | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution]() | c, java, cpp | | 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 | @@ -252,7 +255,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 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]() | py, java | +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution]() | java, 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 | @@ -265,7 +268,7 @@ 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]() | py, c | +| 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 | @@ -289,27 +292,27 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 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]() | py, cpp, c, java | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution]() | c, java, py, cpp | | 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]() | py, c | -| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution]() | py, c, java, rb, kt, rs, js | +| 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 | | 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]() | py, java, c | +| 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]() | Medium | Weekly Premium | [solution]() | py | | 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution]() | java, py | -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution]() | c, cpp, java | +| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution]() | c, java, cpp | | 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]() | py, 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 | | 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution]() | c | @@ -321,7 +324,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 1762 | [Buildings With an Ocean View]() | Medium | | [solution]() | py | | 1768 | [Merge Strings Alternately]() | Easy | | [solution]() | java | | 1783 | [Grand Slam Titles]() | Medium | | [solution]() | sql | -| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution]() | py, cpp, c, java | +| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution]() | c, java, py, cpp | | 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution]() | py | | 1822 | [Sign of the Product of an Array]() | Easy | | [solution]() | c | | 1833 | [Maximum Ice Cream Bars]() | Medium | | [solution]() | c, java, py | @@ -335,30 +338,30 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 1905 | [Count Sub Islands]() | Medium | | [solution]() | py | | 1909 | [Remove One Element to Make the Array Strictly Increasing]() | Easy | | [solution]() | c | | 1929 | [Concatenation of Array]() | Easy | | [solution]() | c, java, py | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution]() | py, java | +| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution]() | java, py | | 1973 | [Count Nodes Equal to Sum of Descendants]() | Medium | | [solution]() | c | -| 1980 | [Find Unique Binary String]() | Medium | | [solution]() | py, c | +| 1980 | [Find Unique Binary String]() | Medium | | [solution]() | c, py | | 1992 | [Find All Groups of Farmland]() | Medium | | [solution]() | java, py | | 2011 | [Final Value of Variable After Performing Operations]() | Easy | | [solution]() | c | | 2013 | [Detect Squares]() | Medium | N150 | [solution]() | py | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution]() | py, c | +| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution]() | c, py | | 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution]() | py | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution]() | py, c | +| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution]() | c, py | | 2086 | [Minimum Number of Food Buckets to Feed the Hamsters]() | Medium | | [solution]() | java | | 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution]() | c, java | | 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution]() | py | | 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution]() | c, py | | 2165 | [Smallest Value of the Rearranged Number]() | Medium | | [solution]() | py | -| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution]() | c, cpp, java, py | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution]() | py, java | +| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution]() | c, java, py, cpp | +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution]() | java, py | | 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution]() | c, py | | 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution]() | c, java | | 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution]() | java | | 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution]() | py | | 2258 | [Escape the Spreading Fire]() | Hard | | [solution]() | py | | 2265 | [Count Nodes Equal to Average of Subtree]() | Medium | | [solution]() | py | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution]() | py, cpp, c, java | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution]() | c, cpp, java, py | +| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution]() | c, java, py, cpp | +| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution]() | c, java, py, cpp | | 2352 | [Equal Row and Column Pairs]() | Medium | | [solution]() | py | | 2365 | [Task Scheduler II]() | Medium | | [solution]() | py | | 2374 | [Node With Highest Edge Score]() | Medium | | [solution]() | py | @@ -366,7 +369,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution]() | py | | 2390 | [Removing Stars From a String]() | Medium | | [solution]() | java, py | | 2395 | [Find Subarrays With Equal Sum]() | Easy | | [solution]() | py | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution]() | py, c, java, rb, kt, rs, cpp, js | +| 2396 | [Strictly Palindromic Number]() | Medium | | [solution]() | kt, java, cpp, c, rb, py, rs, js | | 2405 | [Optimal Partition of String]() | Medium | | [solution]() | py | | 2415 | [Reverse Odd Levels of Binary Tree]() | Medium | | [solution]() | py | | 2423 | [Remove Letter To Equalize Frequency]() | Easy | | [solution]() | py | @@ -374,7 +377,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 2455 | [Average Value of Even Numbers That Are Divisible by Three]() | Easy | | [solution]() | java | | 2473 | [Minimum Cost to Buy Apples]() | Medium | | [solution]() | py | | 2482 | [Difference Between Ones and Zeros in Row and Column]() | Medium | | [solution]() | py | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution]() | py, c, java | +| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution]() | c, java, py | | 2487 | [Remove Nodes From Linked List]() | Medium | | [solution]() | py | | 2545 | [Sort the Students by Their Kth Score]() | Medium | | [solution]() | java, py | | 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution]() | c | @@ -383,14 +386,14 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 2678 | [Number of Senior Citizens]() | Easy | | [solution]() | java | | 2679 | [Sum in a Matrix]() | Medium | | [solution]() | java | | 2734 | [Lexicographically Smallest String After Substring Operation]() | Medium | | [solution]() | py | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution]() | py, java | +| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution]() | java, py | | 2807 | [Insert Greatest Common Divisors in Linked List]() | Medium | | [solution]() | py | | 2816 | [Double a Number Represented as a Linked List]() | Medium | | [solution]() | c | | 2886 | [Change Data Type]() | Easy | | [solution]() | py | | 2894 | [Divisible and Non-divisible Sums Difference]() | Easy | | [solution]() | py | | 2942 | [Find Words Containing Character]() | Easy | | [solution]() | c | | 2954 | [Count the Number of Infection Sequences]() | Hard | | [solution]() | py | -| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution]() | py, java | +| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution]() | java, py | | 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution]() | py | | 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution]() | py | | 3064 | [Guess the Number Using Bitwise Questions I]() | Medium | | [solution]() | c, py | @@ -404,7 +407,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 3175 | bw contest 132 - q2 | Medium | Contest | [solution]() | py | | 3178 | w contest 401 - q1 | Easy | Contest | [solution]() | py | | 3179 | w contest 401 - q2 | Medium | Contest | [solution]() | py | -| 3180 | w contest 401 - q3 | Medium | Contest | [solution]() | py, c | +| 3180 | w contest 401 - q3 | Medium | Contest | [solution]() | c, py | | 3184 | w contest 402 - q1 | Easy | Contest | [solution]() | py | | 3185 | w contest 402 - q2 | Medium | Contest | [solution]() | py | | 3186 | w contest 402 - q3 | Medium | Contest | [solution]() | py | diff --git a/markdowns/Daily_Questions.md b/markdowns/Daily_Questions.md index cae8363e..8b7d24f2 100644 --- a/markdowns/Daily_Questions.md +++ b/markdowns/Daily_Questions.md @@ -1,4 +1,4 @@ -# Daily Questions +# [Daily Questions]() *[Back to top](<../README.md>)* @@ -6,14 +6,14 @@ Dates are for the date I completed the question so due to the my time zone and h | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:------------|:---------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<_2181. Merge Nodes in Between Zeros.md>) | c, cpp, java, py | Jul 03, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | py, cpp, c, java | Jul 02, 2024 | +| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<_2181. Merge Nodes in Between Zeros.md>) | c, java, py, cpp | Jul 03, 2024 | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, java, py, cpp | Jul 02, 2024 | | 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | -| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<_1550. Three Consecutive Odds.md>) | py, c | Jun 30, 2024 | +| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<_1550. Three Consecutive Odds.md>) | c, py | Jun 30, 2024 | | 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable]() | Hard | Daily | [solution](<_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md>) | py | Jun 30, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | py, java | Jun 28, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<_2285. Maximum Total Importance of Roads.md>) | py, cpp, c, java | Jun 27, 2024 | -| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<_1791. Find Center of Star Graph.md>) | py, cpp, c, java | Jun 26, 2024 | +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | +| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<_2285. Maximum Total Importance of Roads.md>) | c, java, py, cpp | Jun 27, 2024 | +| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<_1791. Find Center of Star Graph.md>) | c, java, py, cpp | Jun 26, 2024 | | 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | | 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | | 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | @@ -26,17 +26,17 @@ Dates are for the date I completed the question so due to the my time zone and h | 330 | [Patching Array]() | Hard | Daily | [solution](<_330. Patching Array.md>) | py | Jun 15, 2024 | | 502 | [IPO]() | Hard | Daily | [solution](<_502. IPO.md>) | py | Jun 14, 2024 | | 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution](<_945. Minimum Increment to Make Array Unique.md>) | py | Jun 13, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<_75. Sort Colors.md>) | py, c | Jun 11, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<_1122. Relative Sort Array.md>) | py, java | Jun 10, 2024 | +| 75 | [Sort Colors]() | Medium | Daily | [solution](<_75. Sort Colors.md>) | c, py | Jun 11, 2024 | +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | | 1051 | [Height Checker]() | Easy | Daily | [solution](<_1051. Height Checker.md>) | c, py | Jun 09, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<_974. Subarray Sums Divisible by K.md>) | py, java | Jun 09, 2024 | +| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | | 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution](<_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<_648. Replace Words.md>) | py, java | Jun 06, 2024 | +| 648 | [Replace Words]() | Medium | Daily | [solution](<_648. Replace Words.md>) | java, py | Jun 06, 2024 | | 846 | [Hand of Straights]() | Medium | Daily, N150 | [solution](<_846. Hand of Straights.md>) | py | Jun 06, 2024 | | 1002 | [Find Common Characters]() | Easy | Daily | [solution](<_1002. Find Common Characters.md>) | py | Jun 04, 2024 | | 409 | [Longest Palindrome]() | Easy | Daily | [solution](<_409. Longest Palindrome.md>) | c, py | Jun 03, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<_2037. Minimum Number of Moves to Seat Everyone.md>) | py, c | Jun 03, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<_2486. Append Characters to String to Make Subsequence.md>) | py, c, java | Jun 03, 2024 | +| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | +| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | | 344 | [Reverse String]() | Easy | Daily | [solution](<_344. Reverse String.md>) | java, py | Jun 01, 2024 | | 3110 | [Score of a String]() | Easy | Daily | [solution](<_3110. Score of a String.md>) | java, py | May 31, 2024 | | 260 | [Single Number III]() | Medium | Daily | [solution](<_260. Single Number III.md>) | py | May 30, 2024 | diff --git a/markdowns/Questions_By_Code_Length.md b/markdowns/Questions_By_Code_Length.md index 500d06bf..3f9ee524 100644 --- a/markdowns/Questions_By_Code_Length.md +++ b/markdowns/Questions_By_Code_Length.md @@ -7,22 +7,22 @@ Calculations are based on the code files's byte sizes. | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:---------------------------------------------------------------------------------------------------|:---------------------------------|:----------------| | 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<_2258. Escape the Spreading Fire.md>) | py | Jun 14, 2024 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<_1940. Longest Common Subsequence Between Sorted Arrays.md>) | py, java | Jun 01, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | py, cpp, c, java | Jul 02, 2024 | +| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<_1940. Longest Common Subsequence Between Sorted Arrays.md>) | java, py | Jun 01, 2024 | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, java, py, cpp | Jul 02, 2024 | | 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix]() | Hard | | [solution](<_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md>) | py | Jun 08, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<_1570. Dot Product of Two Sparse Vectors.md>) | py, java, c | Jun 06, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<_212. Word Search II.md>) | py | Jun 27, 2024 | +| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | +| 212 | [Word Search II]() | Hard | N150, B75 | [solution](<_212. Word Search II.md>) | py | Jun 27, 2024 | | 364 | [Nested List Weight Sum II]() | Medium | | [solution](<_364. Nested List Weight Sum II.md>) | java, py | Jul 02, 2024 | -| 165 | [Compare Version Numbers]() | Medium | | [solution](<_165. Compare Version Numbers.md>) | py, c | Jul 02, 2024 | +| 165 | [Compare Version Numbers]() | Medium | | [solution](<_165. Compare Version Numbers.md>) | c, py | Jul 02, 2024 | | 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable]() | Hard | Daily | [solution](<_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md>) | py | Jun 30, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<_1008. Construct Binary Search Tree from Preorder Traversal.md>) | java, cpp, c | Jun 26, 2024 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, java, cpp | Jun 26, 2024 | | 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | | 707 | [Design Linked List]() | Medium | | [solution](<_707. Design Linked List.md>) | java | Jun 21, 2024 | | 339 | [Nested List Weight Sum]() | Medium | | [solution](<_339. Nested List Weight Sum.md>) | c, py | Jul 02, 2024 | | 227 | [Basic Calculator II]() | Medium | | [solution](<_227. Basic Calculator II.md>) | py | Jun 10, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<_648. Replace Words.md>) | py, java | Jun 06, 2024 | +| 648 | [Replace Words]() | Medium | Daily | [solution](<_648. Replace Words.md>) | java, py | Jun 06, 2024 | | 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution](<_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<_543. Diameter of Binary Tree.md>) | java, c, py | Jun 03, 2024 | +| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<_543. Diameter of Binary Tree.md>) | c, java, py | Jun 03, 2024 | | 1482 | [Minimum Number of Days to Make m Bouquets]() | Medium | | [solution](<_1482. Minimum Number of Days to Make m Bouquets.md>) | py | Jun 18, 2024 | | 286 | [Walls and Gates]() | Medium | N150 | [solution](<_286. Walls and Gates.md>) | py | Jun 14, 2024 | | 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | @@ -31,16 +31,16 @@ Calculations are based on the code files's byte sizes. | 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | | 224 | [Basic Calculator]() | Hard | | [solution](<_224. Basic Calculator.md>) | py | Jun 10, 2024 | | 1302 | [Deepest Leaves Sum]() | Medium | | [solution](<_1302. Deepest Leaves Sum.md>) | c, py | Jun 07, 2024 | -| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution](<_19. Remove Nth Node From End of List.md>) | py, c, java | Jun 06, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<_114. Flatten Binary Tree to Linked List.md>) | py, c | Jun 10, 2024 | +| 19 | [Remove Nth Node From End of List]() | Medium | N150, B75 | [solution](<_19. Remove Nth Node From End of List.md>) | c, java, py | Jun 06, 2024 | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | | 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | | 994 | [Rotting Oranges]() | Medium | N150 | [solution](<_994. Rotting Oranges.md>) | py | Jun 14, 2024 | | 382 | [Linked List Random Node]() | Medium | | [solution](<_382. Linked List Random Node.md>) | c, java, py | Jun 21, 2024 | -| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<_2181. Merge Nodes in Between Zeros.md>) | c, cpp, java, py | Jul 03, 2024 | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<_739. Daily Temperatures.md>) | java, c, py | Jun 13, 2024 | +| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<_2181. Merge Nodes in Between Zeros.md>) | c, java, py, cpp | Jul 03, 2024 | +| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<_739. Daily Temperatures.md>) | c, java, py | Jun 13, 2024 | | 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 09, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | py, java | Jun 28, 2024 | -| 3180 | w contest 401 - q3 | Medium | Contest | [solution](<_3180. w contest 401 - q.md>) | py, c | Jun 08, 2024 | +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | +| 3180 | w contest 401 - q3 | Medium | Contest | [solution](<_3180. w contest 401 - q.md>) | c, py | Jun 08, 2024 | | 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution](<_84. Largest Rectangle in Histogram.md>) | py | Jun 10, 2024 | | 1660 | [Correct a Binary Tree]() | Medium | | [solution](<_1660. Correct a Binary Tree.md>) | py | Jun 26, 2024 | | 273 | [Integer to English Words]() | Hard | | [solution](<_273. Integer to English Words.md>) | py | Jun 10, 2024 | @@ -50,17 +50,17 @@ Calculations are based on the code files's byte sizes. | 142 | [Linked List Cycle II]() | Medium | | [solution](<_142. Linked List Cycle II.md>) | py | Jun 25, 2024 | | 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | | 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<_2285. Maximum Total Importance of Roads.md>) | py, cpp, c, java | Jun 27, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<_143. Reorder List.md>) | java, py | Jun 10, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<_2486. Append Characters to String to Make Subsequence.md>) | py, c, java | Jun 03, 2024 | +| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<_2285. Maximum Total Importance of Roads.md>) | c, java, py, cpp | Jun 27, 2024 | +| 143 | [Reorder List]() | Medium | N150, B75 | [solution](<_143. Reorder List.md>) | java, py | Jun 10, 2024 | +| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | | 2415 | [Reverse Odd Levels of Binary Tree]() | Medium | | [solution](<_2415. Reverse Odd Levels of Binary Tree.md>) | py | Jun 23, 2024 | | 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution](<_1602. Find Nearest Right Node in Binary Tree.md>) | java, py | Jul 02, 2024 | | 1252 | [Cells with Odd Values in a Matrix]() | Easy | | [solution](<_1252. Cells with Odd Values in a Matrix.md>) | c | Jun 04, 2024 | | 1743 | [Restore the Array From Adjacent Pairs]() | Medium | | [solution](<_1743. Restore the Array From Adjacent Pairs.md>) | py | Jun 26, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<_75. Sort Colors.md>) | py, c | Jun 11, 2024 | +| 75 | [Sort Colors]() | Medium | Daily | [solution](<_75. Sort Colors.md>) | c, py | Jun 11, 2024 | | 846 | [Hand of Straights]() | Medium | Daily, N150 | [solution](<_846. Hand of Straights.md>) | py | Jun 06, 2024 | | 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | +| 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution](<_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | | 430 | [Flatten a Multilevel Doubly Linked List]() | Medium | | [solution](<_430. Flatten a Multilevel Doubly Linked List.md>) | java, cpp | Jun 26, 2024 | | 616 | [Add Bold Tag in String]() | Medium | | [solution](<_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | | 2 | [Add Two Numbers]() | Medium | N150 | [solution](<_2. Add Two Numbers.md>) | java | May 22, 2024 | @@ -72,21 +72,22 @@ Calculations are based on the code files's byte sizes. | 645 | [Set Mismatch]() | Easy | | [solution](<_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | | 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<_199. Binary Tree Right Side View.md>) | java, cpp | Jul 04, 2024 | | 412 | [Fizz Buzz]() | Easy | | [solution](<_412. Fizz Buzz.md>) | java, py | Jun 02, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<_1696. Jump Game VI.md>) | py, java | Jul 02, 2024 | +| 1696 | [Jump Game VI]() | Medium | | [solution](<_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | | 66 | [Plus One]() | Easy | N150 | [solution](<_66. Plus One.md>) | c | Jun 03, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<_2037. Minimum Number of Moves to Seat Everyone.md>) | py, c | Jun 03, 2024 | +| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | | 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | | 611 | [Valid Triangle Number]() | Medium | | [solution](<_611. Valid Triangle Number.md>) | py | May 22, 2024 | | 353 | [Design Snake Game]() | Medium | | [solution](<_353. Design Snake Game.md>) | py | Jun 28, 2024 | | 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | | 1006 | [Clumsy Factorial]() | Medium | | [solution](<_1006. Clumsy Factorial.md>) | c, py | Jun 11, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<_419. Battleships in a Board.md>) | py, c | Jun 23, 2024 | +| 419 | [Battleships in a Board]() | Medium | | [solution](<_419. Battleships in a Board.md>) | c, py | Jun 23, 2024 | | 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Medium | | [solution](<_1676. Lowest Common Ancestor of a Binary Tree IV.md>) | py | Jun 29, 2024 | | 665 | [Non-decreasing Array]() | Medium | | [solution](<_665. Non-decreasing Array.md>) | java, py | Jun 13, 2024 | | 1248 | [Count Number of Nice Subarrays]() | Medium | Daily | [solution](<_1248. Count Number of Nice Subarrays.md>) | py | Jun 21, 2024 | | 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution](<_1700. Number of Students Unable to Eat Lunch.md>) | py | Jun 01, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<_1980. Find Unique Binary String.md>) | py, c | Jun 26, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<_974. Subarray Sums Divisible by K.md>) | py, java | Jun 09, 2024 | +| 1980 | [Find Unique Binary String]() | Medium | | [solution](<_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | +| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | +| 5 | [Longest Palindromic Substring]() | Medium | N150, B75 | [solution](<_5. Longest Palindromic Substring.md>) | py | Jul 04, 2024 | | 1474 | [Delete N Nodes After M Nodes of a Linked List]() | Easy | | [solution](<_1474. Delete N Nodes After M Nodes of a Linked List.md>) | c, java | Jun 06, 2024 | | 2385 | [Amount of Time for Binary Tree to Be Infected]() | Medium | | [solution](<_2385. Amount of Time for Binary Tree to Be Infected.md>) | py | Jun 26, 2024 | | 414 | [Third Maximum Number]() | Easy | | [solution](<_414. Third Maximum Number.md>) | py | May 23, 2024 | @@ -98,7 +99,7 @@ Calculations are based on the code files's byte sizes. | 374 | [Guess Number Higher or Lower]() | Easy | | [solution](<_374. Guess Number Higher or Lower.md>) | java, py | Jun 02, 2024 | | 771 | [Jewels and Stones]() | Easy | | [solution](<_771. Jewels and Stones.md>) | java, py | Jun 02, 2024 | | 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<_1122. Relative Sort Array.md>) | py, java | Jun 10, 2024 | +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | | 1209 | [Remove All Adjacent Duplicates in String II]() | Medium | | [solution](<_1209. Remove All Adjacent Duplicates in String II.md>) | py | Jun 17, 2024 | | 1171 | [Remove Zero Sum Consecutive Nodes from Linked List]() | Medium | | [solution](<_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>) | py | Jun 15, 2024 | | 791 | [Custom Sort String]() | Medium | | [solution](<_791. Custom Sort String.md>) | java | Jun 24, 2024 | @@ -108,30 +109,30 @@ Calculations are based on the code files's byte sizes. | 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | | 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 20, 2024 | | 1351 | [Count Negative Numbers in a Sorted Matrix]() | Easy | | [solution](<_1351. Count Negative Numbers in a Sorted Matrix.md>) | java, py | Jun 01, 2024 | -| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution](<_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | +| 271 | [Encode and Decode Strings]() | Medium | N150, B75 | [solution](<_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | | 24 | [Swap Nodes in Pairs]() | Medium | | [solution](<_24. Swap Nodes in Pairs.md>) | c | Jun 06, 2024 | -| 1 | [Two Sum]() | Easy | B75, N150 | [solution](<_1. Two Sum.md>) | java, py | May 22, 2024 | +| 1 | [Two Sum]() | Easy | N150, B75 | [solution](<_1. Two Sum.md>) | java, py | May 22, 2024 | | 1268 | [Search Suggestions System]() | Medium | | [solution](<_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | -| 20 | [Valid Parentheses]() | Easy | B75, N150 | [solution](<_20. Valid Parentheses.md>) | java | May 22, 2024 | +| 20 | [Valid Parentheses]() | Easy | N150, B75 | [solution](<_20. Valid Parentheses.md>) | java | May 22, 2024 | | 3136 | [Valid Word]() | Easy | | [solution](<_3136. Valid Word.md>) | c, py | Jul 03, 2024 | | 50 | [Pow(x, n)]() | Medium | N150 | [solution](<_50. Pow(x, n).md>) | c, java, py | Jun 22, 2024 | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<_2743. Count Substrings Without Repeating Character.md>) | py, java | Jun 21, 2024 | +| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 21, 2024 | | 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution](<_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 03, 2024 | | 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution](<_2095. Delete the Middle Node of a Linked List.md>) | c, java | Jun 06, 2024 | | 708 | [Insert into a Sorted Circular Linked List]() | Medium | | [solution](<_708. Insert into a Sorted Circular Linked List.md>) | py | Jun 21, 2024 | | 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | | 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution](<_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 01, 2024 | | 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution](<_107. Binary Tree Level Order Traversal II.md>) | java | Jul 03, 2024 | -| 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution](<_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | +| 238 | [Product of Array Except Self]() | Medium | N150, B75 | [solution](<_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | | 450 | [Delete Node in a BST]() | Medium | | [solution](<_450. Delete Node in a BST.md>) | py | Jun 28, 2024 | | 251 | [Flatten 2D Vector]() | Medium | | [solution](<_251. Flatten 2D Vector.md>) | py | May 22, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<_79. Word Search.md>) | py | Jun 27, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<_1265. Print Immutable Linked List in Reverse.md>) | py, c | Jun 06, 2024 | +| 124 | [Binary Tree Maximum Path Sum]() | Hard | N150, B75 | [solution](<_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | +| 79 | [Word Search]() | Medium | N150, B75 | [solution](<_79. Word Search.md>) | py | Jun 27, 2024 | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | | 409 | [Longest Palindrome]() | Easy | Daily | [solution](<_409. Longest Palindrome.md>) | c, py | Jun 03, 2024 | | 1759 | [Count Number of Homogenous Substrings]() | Medium | | [solution](<_1759. Count Number of Homogenous Substrings.md>) | c, java | Jun 10, 2024 | | 713 | [Subarray Product Less Than K]() | Medium | | [solution](<_713. Subarray Product Less Than K.md>) | py | Jul 01, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<_48. Rotate Image.md>) | c, py | Jun 14, 2024 | +| 48 | [Rotate Image]() | Medium | N150, B75 | [solution](<_48. Rotate Image.md>) | c, py | Jun 14, 2024 | | 90 | [Subsets II]() | Medium | N150 | [solution](<_90. Subsets II.md>) | py | Jul 03, 2024 | | 676 | [Implement Magic Dictionary]() | Medium | | [solution](<_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | | 1184 | [Distance Between Bus Stops]() | Easy | | [solution](<_1184. Distance Between Bus Stops.md>) | py | May 31, 2024 | @@ -140,11 +141,11 @@ Calculations are based on the code files's byte sizes. | 1730 | [Shortest Path to Get Food]() | Medium | | [solution](<_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 | | 2405 | [Optimal Partition of String]() | Medium | | [solution](<_2405. Optimal Partition of String.md>) | py | Jun 23, 2024 | | 1254 | [Number of Closed Islands]() | Medium | | [solution](<_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution](<_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | +| 211 | [Design Add and Search Words Data Structure]() | Medium | N150, B75 | [solution](<_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | +| 128 | [Longest Consecutive Sequence]() | Medium | N150, B75 | [solution](<_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | | 946 | [Validate Stack Sequences]() | Medium | | [solution](<_946. Validate Stack Sequences.md>) | c, py | Jun 11, 2024 | | 1020 | [Number of Enclaves]() | Medium | | [solution](<_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<_141. Linked List Cycle.md>) | py, c | Jun 03, 2024 | +| 141 | [Linked List Cycle]() | Easy | N150, B75 | [solution](<_141. Linked List Cycle.md>) | c, py | Jun 03, 2024 | | 61 | [Rotate List]() | Medium | | [solution](<_61. Rotate List.md>) | py | Jun 21, 2024 | | 138 | [Copy List with Random Pointer]() | Medium | N150 | [solution](<_138. Copy List with Random Pointer.md>) | py | Jun 27, 2024 | | 2954 | [Count the Number of Infection Sequences]() | Hard | | [solution](<_2954. Count the Number of Infection Sequences.md>) | py | Jun 26, 2024 | @@ -156,12 +157,12 @@ Calculations are based on the code files's byte sizes. | 366 | [Find Leaves of Binary Tree]() | Medium | | [solution](<_366. Find Leaves of Binary Tree.md>) | py | Jun 11, 2024 | | 3064 | [Guess the Number Using Bitwise Questions I]() | Medium | | [solution](<_3064. Guess the Number Using Bitwise Questions I.md>) | c, py | Jun 06, 2024 | | 542 | [01 Matrix]() | Medium | | [solution](<_542. 01 Matrix.md>) | py | Jun 26, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 1315 | [Sum of Nodes with Even-Valued Grandparent]() | Medium | | [solution](<_1315. Sum of Nodes with Even-Valued Grandparent.md>) | py | Jun 11, 2024 | | 2671 | [Frequency Tracker]() | Medium | | [solution](<_2671. Frequency Tracker.md>) | py | Jun 28, 2024 | | 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution](<_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 | -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution](<_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | +| 23 | [Merge k Sorted Lists]() | Hard | N150, B75 | [solution](<_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | +| 102 | [Binary Tree Level Order Traversal]() | Medium | N150, B75 | [solution](<_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | | 394 | [Decode String]() | Medium | | [solution](<_394. Decode String.md>) | py | Jun 14, 2024 | | 1166 | [Design File System]() | Medium | | [solution](<_1166. Design File System.md>) | py | Jun 27, 2024 | | 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution](<_1552. Magnetic Force Between Two Balls.md>) | py | Jun 20, 2024 | @@ -170,22 +171,22 @@ Calculations are based on the code files's byte sizes. | 1522 | [Diameter of N-Ary Tree]() | Medium | | [solution](<_1522. Diameter of N-Ary Tree.md>) | py | Jul 02, 2024 | | 744 | [Find Smallest Letter Greater Than Target]() | Easy | | [solution](<_744. Find Smallest Letter Greater Than Target.md>) | java, py | Jun 01, 2024 | | 3186 | w contest 402 - q3 | Medium | Contest | [solution](<_3186. w contest 402 - q.md>) | py | Jun 15, 2024 | -| 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution](<_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | +| 125 | [Valid Palindrome]() | Easy | N150, B75 | [solution](<_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | | 77 | [Combinations]() | Medium | | [solution](<_77. Combinations.md>) | py | Jun 07, 2024 | | 1905 | [Count Sub Islands]() | Medium | | [solution](<_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | -| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<_1791. Find Center of Star Graph.md>) | py, cpp, c, java | Jun 26, 2024 | +| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<_1791. Find Center of Star Graph.md>) | c, java, py, cpp | Jun 26, 2024 | | 993 | [Cousins in Binary Tree]() | Easy | | [solution](<_993. Cousins in Binary Tree.md>) | py | Jul 03, 2024 | | 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | | 2165 | [Smallest Value of the Rearranged Number]() | Medium | | [solution](<_2165. Smallest Value of the Rearranged Number.md>) | py | Jun 30, 2024 | | 2374 | [Node With Highest Edge Score]() | Medium | | [solution](<_2374. Node With Highest Edge Score.md>) | py | Jun 17, 2024 | | 890 | [Find and Replace Pattern]() | Medium | | [solution](<_890. Find and Replace Pattern.md>) | py | Jul 02, 2024 | -| 21 | [Merge Two Sorted Lists]() | Easy | B75, N150 | [solution](<_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | +| 21 | [Merge Two Sorted Lists]() | Easy | N150, B75 | [solution](<_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | +| 208 | [Implement Trie (Prefix Tree)]() | Medium | N150, B75 | [solution](<_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | | 2679 | [Sum in a Matrix]() | Medium | | [solution](<_2679. Sum in a Matrix.md>) | java | May 22, 2024 | | 784 | [Letter Case Permutation]() | Medium | | [solution](<_784. Letter Case Permutation.md>) | py | Jun 14, 2024 | | 535 | [Encode and Decode TinyURL]() | Medium | | [solution](<_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<_2396. Strictly Palindromic Number.md>) | py, c, java, rb, kt, rs, cpp, js | Jun 09, 2024 | +| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<_2396. Strictly Palindromic Number.md>) | kt, java, cpp, c, rb, py, rs, js | Jun 09, 2024 | | 1833 | [Maximum Ice Cream Bars]() | Medium | | [solution](<_1833. Maximum Ice Cream Bars.md>) | c, java, py | Jun 23, 2024 | | 3179 | w contest 401 - q2 | Medium | Contest | [solution](<_3179. w contest 401 - q.md>) | py | Jun 08, 2024 | | 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | @@ -208,7 +209,7 @@ Calculations are based on the code files's byte sizes. | 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution](<_150. Evaluate Reverse Polish Notation.md>) | py | Jun 10, 2024 | | 3195 | w contest 403 - q2 | Medium | Contest | [solution](<_3195. w contest 403 - q.md>) | py | Jun 22, 2024 | | 3196 | w contest 403 - q3 | Medium | Contest | [solution](<_3196. w contest 403 - q.md>) | py | Jun 22, 2024 | -| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | py, java | Jun 11, 2024 | +| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | java, py | Jun 11, 2024 | | 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution](<_950. Reveal Cards In Increasing Order.md>) | py | Jun 11, 2024 | | 112 | [Path Sum]() | Easy | | [solution](<_112. Path Sum.md>) | py | Jul 03, 2024 | | 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | @@ -216,18 +217,18 @@ Calculations are based on the code files's byte sizes. | 46 | [Permutations]() | Medium | N150 | [solution](<_46. Permutations.md>) | py | Jun 07, 2024 | | 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | | 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution](<_1721. Swapping Nodes in a Linked List.md>) | c | Jun 06, 2024 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | +| 98 | [Validate Binary Search Tree]() | Medium | N150, B75 | [solution](<_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | | 328 | [Odd Even Linked List]() | Medium | | [solution](<_328. Odd Even Linked List.md>) | py | Jun 21, 2024 | | 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution](<_1580. Put Boxes Into the Warehouse II.md>) | py | Jun 14, 2024 | | 687 | [Longest Univalue Path]() | Medium | | [solution](<_687. Longest Univalue Path.md>) | py | Jul 03, 2024 | | 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | | 3174 | bw contest 132 - q1 | Easy | Contest | [solution](<_3174. bw contest 132 - q.md>) | py | Jun 08, 2024 | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<_49. Group Anagrams.md>) | py | Jun 12, 2024 | +| 49 | [Group Anagrams]() | Medium | N150, B75 | [solution](<_49. Group Anagrams.md>) | py | Jun 12, 2024 | | 720 | [Longest Word in Dictionary]() | Medium | | [solution](<_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | | 1858 | [Longest Word With All Prefixes]() | Medium | | [solution](<_1858. Longest Word With All Prefixes.md>) | py | Jun 29, 2024 | | 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution](<_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 | | 1929 | [Concatenation of Array]() | Easy | | [solution](<_1929. Concatenation of Array.md>) | c, java, py | Jun 03, 2024 | -| 242 | [Valid Anagram]() | Easy | B75, N150 | [solution](<_242. Valid Anagram.md>) | py, c | Jun 12, 2024 | +| 242 | [Valid Anagram]() | Easy | N150, B75 | [solution](<_242. Valid Anagram.md>) | c, py | Jun 12, 2024 | | 690 | [Employee Importance]() | Medium | | [solution](<_690. Employee Importance.md>) | java | Jul 02, 2024 | | 776 | [Split BST]() | Medium | Weekly Premium | [solution](<_776. Split BST.md>) | py | Jun 28, 2024 | | 1026 | [Maximum Difference Between Node and Ancestor]() | Medium | | [solution](<_1026. Maximum Difference Between Node and Ancestor.md>) | py | Jun 23, 2024 | @@ -236,15 +237,15 @@ Calculations are based on the code files's byte sizes. | 1852 | [Distinct Numbers in Each Subarray]() | Medium | | [solution](<_1852. Distinct Numbers in Each Subarray.md>) | java | Jun 26, 2024 | | 1874 | [Minimize Product Sum of Two Arrays]() | Medium | | [solution](<_1874. Minimize Product Sum of Two Arrays.md>) | c, java | Jun 22, 2024 | | 155 | [Min Stack]() | Medium | N150 | [solution](<_155. Min Stack.md>) | py | Jun 13, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | +| 200 | [Number of Islands]() | Medium | N150, B75 | [solution](<_200. Number of Islands.md>) | py | Jun 16, 2024 | +| 230 | [Kth Smallest Element in a BST]() | Medium | N150, B75 | [solution](<_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | | 1426 | [Counting Elements]() | Easy | | [solution](<_1426. Counting Elements.md>) | c | Jun 04, 2024 | | 8 | [String to Integer (atoi)]() | Medium | | [solution](<_8. String to Integer (atoi).md>) | py | Jun 10, 2024 | | 1051 | [Height Checker]() | Easy | Daily | [solution](<_1051. Height Checker.md>) | c, py | Jun 09, 2024 | | 856 | [Score of Parentheses]() | Medium | | [solution](<_856. Score of Parentheses.md>) | py | Jun 17, 2024 | | 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | | 2734 | [Lexicographically Smallest String After Substring Operation]() | Medium | | [solution](<_2734. Lexicographically Smallest String After Substring Operation.md>) | py | Jun 29, 2024 | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | Jun 24, 2024 | +| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<_2317. Maximum XOR After Operations .md>) | c, java, py, cpp | Jun 24, 2024 | | 1535 | [Find the Winner of an Array Game]() | Medium | | [solution](<_1535. Find the Winner of an Array Game.md>) | py | Jun 08, 2024 | | 1404 | [Number of Steps to Reduce a Number in Binary Representation to One]() | Medium | Daily | [solution](<_1404. Number of Steps to Reduce a Number in Binary Representation to One.md>) | py | May 29, 2024 | | 71 | [Simplify Path]() | Medium | | [solution](<_71. Simplify Path.md>) | py | Jun 10, 2024 | @@ -255,37 +256,38 @@ Calculations are based on the code files's byte sizes. | 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | | 1909 | [Remove One Element to Make the Array Strictly Increasing]() | Easy | | [solution](<_1909. Remove One Element to Make the Array Strictly Increasing.md>) | c | Jun 16, 2024 | | 110 | [Balanced Binary Tree]() | Easy | N150 | [solution](<_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<_100. Same Tree.md>) | py | Jul 03, 2024 | +| 100 | [Same Tree]() | Easy | N150, B75 | [solution](<_100. Same Tree.md>) | py | Jul 03, 2024 | | 1836 | [Remove Duplicates From an Unsorted Linked List]() | Medium | | [solution](<_1836. Remove Duplicates From an Unsorted Linked List.md>) | py | Jul 04, 2024 | | 1249 | [Minimum Remove to Make Valid Parentheses]() | Medium | | [solution](<_1249. Minimum Remove to Make Valid Parentheses.md>) | py | Jun 10, 2024 | | 2482 | [Difference Between Ones and Zeros in Row and Column]() | Medium | | [solution](<_2482. Difference Between Ones and Zeros in Row and Column.md>) | py | Jun 07, 2024 | | 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<_74. Search a 2D Matrix.md>) | py | Jun 14, 2024 | | 853 | [Car Fleet]() | Medium | N150 | [solution](<_853. Car Fleet.md>) | py | Jun 13, 2024 | -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution](<_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | +| 3 | [Longest Substring Without Repeating Characters]() | Medium | N150, B75 | [solution](<_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | | 1052 | [Grumpy Bookstore Owner]() | Medium | Daily | [solution](<_1052. Grumpy Bookstore Owner.md>) | py | Jun 20, 2024 | +| 647 | [Palindromic Substrings]() | Medium | N150, B75 | [solution](<_647. Palindromic Substrings.md>) | py | Jul 04, 2024 | | 2816 | [Double a Number Represented as a Linked List]() | Medium | | [solution](<_2816. Double a Number Represented as a Linked List.md>) | c | Jul 04, 2024 | | 1502 | [Can Make Arithmetic Progression From Sequence]() | Easy | | [solution](<_1502. Can Make Arithmetic Progression From Sequence.md>) | c, py | Jun 04, 2024 | -| 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution](<_70. Climbing Stairs.md>) | py | May 22, 2024 | +| 70 | [Climbing Stairs]() | Easy | N150, B75 | [solution](<_70. Climbing Stairs.md>) | py | May 22, 2024 | | 118 | [Pascal's Triangle]() | Easy | | [solution](<_118. Pascal's Triangle.md>) | py | May 22, 2024 | -| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution](<_1551. Minimum Operations to Make Array Equal.md>) | py, c, java, rb, kt, rs, js | Jun 12, 2024 | +| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution](<_1551. Minimum Operations to Make Array Equal.md>) | kt, java, c, rb, py, rs, js | Jun 12, 2024 | | 22 | [Generate Parentheses]() | Medium | N150 | [solution](<_22. Generate Parentheses.md>) | py | Jun 13, 2024 | | 1669 | [Merge In Between Linked Lists]() | Medium | | [solution](<_1669. Merge In Between Linked Lists.md>) | c | Jun 24, 2024 | | 14 | [Longest Common Prefix]() | Easy | | [solution](<_14. Longest Common Prefix.md>) | java | May 22, 2024 | | 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | | 1002 | [Find Common Characters]() | Easy | Daily | [solution](<_1002. Find Common Characters.md>) | py | Jun 04, 2024 | -| 206 | [Reverse Linked List]() | Easy | B75, N150 | [solution](<_206. Reverse Linked List.md>) | java | Jun 27, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<_2083. Substrings That Begin and End With the Same Letter.md>) | py, c | Jun 10, 2024 | +| 206 | [Reverse Linked List]() | Easy | N150, B75 | [solution](<_206. Reverse Linked List.md>) | java | Jun 27, 2024 | +| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | | 429 | [N-ary Tree Level Order Traversal]() | Medium | | [solution](<_429. N-ary Tree Level Order Traversal.md>) | py | Jul 03, 2024 | | 1233 | [Remove Sub-Folders from the Filesystem]() | Medium | | [solution](<_1233. Remove Sub-Folders from the Filesystem.md>) | py | Jun 27, 2024 | | 27 | [Remove Element]() | Easy | | [solution](<_27. Remove Element.md>) | java, py | Jun 02, 2024 | | 2086 | [Minimum Number of Food Buckets to Feed the Hamsters]() | Medium | | [solution](<_2086. Minimum Number of Food Buckets to Feed the Hamsters.md>) | java | Jul 01, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 57 | [Insert Interval]() | Medium | B75, N150 | [solution](<_57. Insert Interval.md>) | py | Jun 18, 2024 | +| 226 | [Invert Binary Tree]() | Easy | N150, B75 | [solution](<_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | +| 57 | [Insert Interval]() | Medium | N150, B75 | [solution](<_57. Insert Interval.md>) | py | Jun 18, 2024 | | 3191 | Question 3191 | Medium | | [solution](<_3191. Question 319.md>) | java | Jun 22, 2024 | | 3192 | Question 3192 | Medium | | [solution](<_3192. Question 319.md>) | java | Jun 22, 2024 | | 1736 | [Latest Time by Replacing Hidden Digits]() | Easy | | [solution](<_1736. Latest Time by Replacing Hidden Digits.md>) | c | Jun 03, 2024 | | 260 | [Single Number III]() | Medium | Daily | [solution](<_260. Single Number III.md>) | py | May 30, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | +| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | N150, B75 | [solution](<_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | | 1317 | [Convert Integer to the Sum of Two No-Zero Integers]() | Easy | | [solution](<_1317. Convert Integer to the Sum of Two No-Zero Integers.md>) | c | Jun 04, 2024 | | 1046 | [Last Stone Weight]() | Easy | N150 | [solution](<_1046. Last Stone Weight.md>) | py | Jun 03, 2024 | | 2942 | [Find Words Containing Character]() | Easy | | [solution](<_2942. Find Words Containing Character.md>) | c | Jun 03, 2024 | @@ -299,8 +301,8 @@ Calculations are based on the code files's byte sizes. | 345 | [Reverse Vowels of a String]() | Easy | | [solution](<_345. Reverse Vowels of a String.md>) | py | May 23, 2024 | | 344 | [Reverse String]() | Easy | Daily | [solution](<_344. Reverse String.md>) | java, py | Jun 01, 2024 | | 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | -| 56 | [Merge Intervals]() | Medium | B75, N150 | [solution](<_56. Merge Intervals.md>) | py | Jun 18, 2024 | -| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<_1550. Three Consecutive Odds.md>) | py, c | Jun 30, 2024 | +| 56 | [Merge Intervals]() | Medium | N150, B75 | [solution](<_56. Merge Intervals.md>) | py | Jun 18, 2024 | +| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<_1550. Three Consecutive Odds.md>) | c, py | Jun 30, 2024 | | 1973 | [Count Nodes Equal to Sum of Descendants]() | Medium | | [solution](<_1973. Count Nodes Equal to Sum of Descendants.md>) | c | Jun 23, 2024 | | 849 | [Maximize Distance to Closest Person]() | Medium | | [solution](<_849. Maximize Distance to Closest Person.md>) | py | Jun 29, 2024 | | 1460 | [Make Two Arrays Equal by Reversing Subarrays]() | Easy | | [solution](<_1460. Make Two Arrays Equal by Reversing Subarrays.md>) | c | Jun 04, 2024 | @@ -310,7 +312,7 @@ Calculations are based on the code files's byte sizes. | 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<_826. Most Profit Assigning Work.md>) | py | Jun 17, 2024 | | 663 | [Equal Tree Partition]() | Medium | Daily | [solution](<_663. Equal Tree Partition.md>) | py | Jun 16, 2024 | | 3110 | [Score of a String]() | Easy | Daily | [solution](<_3110. Score of a String.md>) | java, py | May 31, 2024 | -| 121 | [Best Time to Buy and Sell Stock]() | Easy | B75, N150 | [solution](<_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | +| 121 | [Best Time to Buy and Sell Stock]() | Easy | N150, B75 | [solution](<_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | | 189 | [Rotate Array]() | Medium | | [solution](<_189. Rotate Array.md>) | py | Jun 02, 2024 | | 392 | [Is Subsequence]() | Easy | | [solution](<_392. Is Subsequence.md>) | java | Jun 21, 2024 | | 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 13, 2024 | @@ -327,7 +329,7 @@ Calculations are based on the code files's byte sizes. | 196 | [Delete Duplicate Emails]() | Easy | | [solution](<_196. Delete Duplicate Emails.md>) | py, sql | Jun 07, 2024 | | 2365 | [Task Scheduler II]() | Medium | | [solution](<_2365. Task Scheduler II.md>) | py | Jun 29, 2024 | | 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers]() | Medium | | [solution](<_1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.md>) | c, java | Jun 22, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | +| 104 | [Maximum Depth of Binary Tree]() | Easy | N150, B75 | [solution](<_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | | 451 | [Sort Characters By Frequency]() | Medium | | [solution](<_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | | 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution](<_26. Remove Duplicates from Sorted Array.md>) | java | May 22, 2024 | | 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution](<_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>) | py | May 29, 2024 | @@ -335,9 +337,9 @@ Calculations are based on the code files's byte sizes. | 607 | [Sales Person]() | Easy | | [solution](<_607. Sales Person.md>) | sql | May 22, 2024 | | 7 | [Reverse Integer]() | Medium | N150 | [solution](<_7. Reverse Integer.md>) | py | May 29, 2024 | | 1282 | [Group the People Given the Group Size They Belong To]() | Medium | | [solution](<_1282. Group the People Given the Group Size They Belong To.md>) | py | Jun 27, 2024 | -| 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution](<_217. Contains Duplicate.md>) | py | Jun 11, 2024 | +| 217 | [Contains Duplicate]() | Easy | N150, B75 | [solution](<_217. Contains Duplicate.md>) | py | Jun 11, 2024 | | 848 | [Shifting Letters]() | Medium | | [solution](<_848. Shifting Letters.md>) | py | Jun 29, 2024 | -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 | +| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<_1641. Count Sorted Vowel Strings.md>) | c, java, cpp | Jun 24, 2024 | | 2455 | [Average Value of Even Numbers That Are Divisible by Three]() | Easy | | [solution](<_2455. Average Value of Even Numbers That Are Divisible by Three.md>) | java | Jul 04, 2024 | | 175 | [Combine Two Tables]() | Easy | | [solution](<_175. Combine Two Tables.md>) | py, sql | May 22, 2024 | | 3184 | w contest 402 - q1 | Easy | Contest | [solution](<_3184. w contest 402 - q.md>) | py | Jun 15, 2024 | @@ -346,7 +348,7 @@ Calculations are based on the code files's byte sizes. | 867 | [Transpose Matrix]() | Easy | | [solution](<_867. Transpose Matrix.md>) | py | Jun 14, 2024 | | 1844 | [Replace All Digits with Characters]() | Easy | | [solution](<_1844. Replace All Digits with Characters.md>) | py | Jun 29, 2024 | | 3178 | w contest 401 - q1 | Easy | Contest | [solution](<_3178. w contest 401 - q.md>) | py | Jun 08, 2024 | -| 191 | [Number of 1 Bits]() | Easy | B75, N150 | [solution](<_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | +| 191 | [Number of 1 Bits]() | Easy | N150, B75 | [solution](<_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | | 3074 | [Apple Redistribution into Boxes]() | Easy | | [solution](<_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 | | 9 | [Palindrome Number]() | Easy | | [solution](<_9. Palindrome Number.md>) | java | May 22, 2024 | | 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 | @@ -359,6 +361,7 @@ Calculations are based on the code files's byte sizes. | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | | 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | | 3194 | w contest 403 - q1 | Easy | Contest | [solution](<_3194. w contest 403 - q.md>) | py | Jun 22, 2024 | +| 746 | [Min Cost Climbing Stairs]() | Easy | N150 | [solution](<_746. Min Cost Climbing Stairs.md>) | py | Jul 04, 2024 | | 3190 | Question 3190 | Easy | | [solution](<_3190. Question 319.md>) | java | Jun 22, 2024 | | 1018 | [Binary Prefix Divisible By 5]() | Easy | | [solution](<_1018. Binary Prefix Divisible By 5.md>) | py | Jul 04, 2024 | | 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | diff --git a/markdowns/Questions_By_Recent.md b/markdowns/Questions_By_Recent.md index 573a79ec..64353dee 100644 --- a/markdowns/Questions_By_Recent.md +++ b/markdowns/Questions_By_Recent.md @@ -6,12 +6,15 @@ Calculations are based on the date of the first solve. | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:---------------------------------------------------------------------------------------------------|:---------------------------------|:----------------| -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | +| 647 | [Palindromic Substrings]() | Medium | N150, B75 | [solution](<_647. Palindromic Substrings.md>) | py | Jul 04, 2024 | +| 5 | [Longest Palindromic Substring]() | Medium | N150, B75 | [solution](<_5. Longest Palindromic Substring.md>) | py | Jul 04, 2024 | +| 746 | [Min Cost Climbing Stairs]() | Easy | N150 | [solution](<_746. Min Cost Climbing Stairs.md>) | py | Jul 04, 2024 | +| 124 | [Binary Tree Maximum Path Sum]() | Hard | N150, B75 | [solution](<_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | | 1448 | [Count Good Nodes in Binary Tree]() | Medium | N150 | [solution](<_1448. Count Good Nodes in Binary Tree.md>) | java | Jul 04, 2024 | | 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<_199. Binary Tree Right Side View.md>) | java, cpp | Jul 04, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | +| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | N150, B75 | [solution](<_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | | 110 | [Balanced Binary Tree]() | Easy | N150 | [solution](<_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | +| 104 | [Maximum Depth of Binary Tree]() | Easy | N150, B75 | [solution](<_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | | 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution](<_82. Remove Duplicates from Sorted List II.md>) | py | Jul 04, 2024 | | 1836 | [Remove Duplicates From an Unsorted Linked List]() | Medium | | [solution](<_1836. Remove Duplicates From an Unsorted Linked List.md>) | py | Jul 04, 2024 | | 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution](<_2046. Sort Linked List Already Sorted Using Absolute Values.md>) | py | Jul 04, 2024 | @@ -25,8 +28,8 @@ Calculations are based on the date of the first solve. | 429 | [N-ary Tree Level Order Traversal]() | Medium | | [solution](<_429. N-ary Tree Level Order Traversal.md>) | py | Jul 03, 2024 | | 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | | 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution](<_107. Binary Tree Level Order Traversal II.md>) | java | Jul 03, 2024 | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution](<_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | -| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<_2181. Merge Nodes in Between Zeros.md>) | c, cpp, java, py | Jul 03, 2024 | +| 102 | [Binary Tree Level Order Traversal]() | Medium | N150, B75 | [solution](<_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | +| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<_2181. Merge Nodes in Between Zeros.md>) | c, java, py, cpp | Jul 03, 2024 | | 687 | [Longest Univalue Path]() | Medium | | [solution](<_687. Longest Univalue Path.md>) | py | Jul 03, 2024 | | 437 | [Path Sum III]() | Medium | | [solution](<_437. Path Sum III.md>) | py | Jul 03, 2024 | | 112 | [Path Sum]() | Easy | | [solution](<_112. Path Sum.md>) | py | Jul 03, 2024 | @@ -34,16 +37,16 @@ Calculations are based on the date of the first solve. | 666 | [Path Sum IV]() | Medium | | [solution](<_666. Path Sum IV.md>) | py | Jul 03, 2024 | | 513 | [Find Bottom Left Tree Value]() | Medium | | [solution](<_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 | | 3136 | [Valid Word]() | Easy | | [solution](<_3136. Valid Word.md>) | c, py | Jul 03, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 191 | [Number of 1 Bits]() | Easy | B75, N150 | [solution](<_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | -| 121 | [Best Time to Buy and Sell Stock]() | Easy | B75, N150 | [solution](<_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | +| 226 | [Invert Binary Tree]() | Easy | N150, B75 | [solution](<_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | +| 191 | [Number of 1 Bits]() | Easy | N150, B75 | [solution](<_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | +| 121 | [Best Time to Buy and Sell Stock]() | Easy | N150, B75 | [solution](<_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | | 136 | [Single Number]() | Easy | N150 | [solution](<_136. Single Number.md>) | py | Jul 03, 2024 | | 90 | [Subsets II]() | Medium | N150 | [solution](<_90. Subsets II.md>) | py | Jul 03, 2024 | | 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution](<_103. Binary Tree Zigzag Level Order Traversal.md>) | py | Jul 03, 2024 | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<_100. Same Tree.md>) | py | Jul 03, 2024 | +| 100 | [Same Tree]() | Easy | N150, B75 | [solution](<_100. Same Tree.md>) | py | Jul 03, 2024 | | 890 | [Find and Replace Pattern]() | Medium | | [solution](<_890. Find and Replace Pattern.md>) | py | Jul 02, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<_1696. Jump Game VI.md>) | py, java | Jul 02, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | py, cpp, c, java | Jul 02, 2024 | +| 1696 | [Jump Game VI]() | Medium | | [solution](<_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, java, py, cpp | Jul 02, 2024 | | 1522 | [Diameter of N-Ary Tree]() | Medium | | [solution](<_1522. Diameter of N-Ary Tree.md>) | py | Jul 02, 2024 | | 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution](<_1602. Find Nearest Right Node in Binary Tree.md>) | java, py | Jul 02, 2024 | | 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | @@ -51,12 +54,12 @@ Calculations are based on the date of the first solve. | 690 | [Employee Importance]() | Medium | | [solution](<_690. Employee Importance.md>) | java | Jul 02, 2024 | | 364 | [Nested List Weight Sum II]() | Medium | | [solution](<_364. Nested List Weight Sum II.md>) | java, py | Jul 02, 2024 | | 339 | [Nested List Weight Sum]() | Medium | | [solution](<_339. Nested List Weight Sum.md>) | c, py | Jul 02, 2024 | -| 165 | [Compare Version Numbers]() | Medium | | [solution](<_165. Compare Version Numbers.md>) | py, c | Jul 02, 2024 | +| 165 | [Compare Version Numbers]() | Medium | | [solution](<_165. Compare Version Numbers.md>) | c, py | Jul 02, 2024 | | 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | | 713 | [Subarray Product Less Than K]() | Medium | | [solution](<_713. Subarray Product Less Than K.md>) | py | Jul 01, 2024 | | 1768 | [Merge Strings Alternately]() | Easy | | [solution](<_1768. Merge Strings Alternately.md>) | java | Jul 01, 2024 | | 2086 | [Minimum Number of Food Buckets to Feed the Hamsters]() | Medium | | [solution](<_2086. Minimum Number of Food Buckets to Feed the Hamsters.md>) | java | Jul 01, 2024 | -| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<_1550. Three Consecutive Odds.md>) | py, c | Jun 30, 2024 | +| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<_1550. Three Consecutive Odds.md>) | c, py | Jun 30, 2024 | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | | 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution](<_1028. Recover a Tree From Preorder Traversal.md>) | py | Jun 30, 2024 | | 2165 | [Smallest Value of the Rearranged Number]() | Medium | | [solution](<_2165. Smallest Value of the Rearranged Number.md>) | py | Jun 30, 2024 | @@ -76,10 +79,10 @@ Calculations are based on the date of the first solve. | 2473 | [Minimum Cost to Buy Apples]() | Medium | | [solution](<_2473. Minimum Cost to Buy Apples.md>) | py | Jun 28, 2024 | | 384 | [Shuffle an Array]() | Medium | | [solution](<_384. Shuffle an Array.md>) | py | Jun 28, 2024 | | 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | +| 230 | [Kth Smallest Element in a BST]() | Medium | N150, B75 | [solution](<_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | | 450 | [Delete Node in a BST]() | Medium | | [solution](<_450. Delete Node in a BST.md>) | py | Jun 28, 2024 | | 776 | [Split BST]() | Medium | Weekly Premium | [solution](<_776. Split BST.md>) | py | Jun 28, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | py, java | Jun 28, 2024 | +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | | 353 | [Design Snake Game]() | Medium | | [solution](<_353. Design Snake Game.md>) | py | Jun 28, 2024 | | 2671 | [Frequency Tracker]() | Medium | | [solution](<_2671. Frequency Tracker.md>) | py | Jun 28, 2024 | | 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | @@ -90,25 +93,25 @@ Calculations are based on the date of the first solve. | 616 | [Add Bold Tag in String]() | Medium | | [solution](<_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | | 758 | [Bold Words in String]() | Medium | | [solution](<_758. Bold Words in String.md>) | py | Jun 27, 2024 | | 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<_2285. Maximum Total Importance of Roads.md>) | py, cpp, c, java | Jun 27, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<_79. Word Search.md>) | py | Jun 27, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<_212. Word Search II.md>) | py | Jun 27, 2024 | +| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<_2285. Maximum Total Importance of Roads.md>) | c, java, py, cpp | Jun 27, 2024 | +| 79 | [Word Search]() | Medium | N150, B75 | [solution](<_79. Word Search.md>) | py | Jun 27, 2024 | +| 212 | [Word Search II]() | Hard | N150, B75 | [solution](<_212. Word Search II.md>) | py | Jun 27, 2024 | | 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | | 720 | [Longest Word in Dictionary]() | Medium | | [solution](<_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | | 676 | [Implement Magic Dictionary]() | Medium | | [solution](<_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | +| 211 | [Design Add and Search Words Data Structure]() | Medium | N150, B75 | [solution](<_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | +| 208 | [Implement Trie (Prefix Tree)]() | Medium | N150, B75 | [solution](<_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | | 138 | [Copy List with Random Pointer]() | Medium | N150 | [solution](<_138. Copy List with Random Pointer.md>) | py | Jun 27, 2024 | -| 206 | [Reverse Linked List]() | Easy | B75, N150 | [solution](<_206. Reverse Linked List.md>) | java | Jun 27, 2024 | +| 206 | [Reverse Linked List]() | Easy | N150, B75 | [solution](<_206. Reverse Linked List.md>) | java | Jun 27, 2024 | | 1852 | [Distinct Numbers in Each Subarray]() | Medium | | [solution](<_1852. Distinct Numbers in Each Subarray.md>) | java | Jun 26, 2024 | | 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<_1008. Construct Binary Search Tree from Preorder Traversal.md>) | java, cpp, c | Jun 26, 2024 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, java, cpp | Jun 26, 2024 | | 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<_2352. Equal Row and Column Pairs.md>) | py | Jun 26, 2024 | | 430 | [Flatten a Multilevel Doubly Linked List]() | Medium | | [solution](<_430. Flatten a Multilevel Doubly Linked List.md>) | java, cpp | Jun 26, 2024 | | 1660 | [Correct a Binary Tree]() | Medium | | [solution](<_1660. Correct a Binary Tree.md>) | py | Jun 26, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<_1980. Find Unique Binary String.md>) | py, c | Jun 26, 2024 | +| 1980 | [Find Unique Binary String]() | Medium | | [solution](<_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | | 1743 | [Restore the Array From Adjacent Pairs]() | Medium | | [solution](<_1743. Restore the Array From Adjacent Pairs.md>) | py | Jun 26, 2024 | -| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<_1791. Find Center of Star Graph.md>) | py, cpp, c, java | Jun 26, 2024 | +| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<_1791. Find Center of Star Graph.md>) | c, java, py, cpp | Jun 26, 2024 | | 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | | 1254 | [Number of Closed Islands]() | Medium | | [solution](<_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | | 1020 | [Number of Enclaves]() | Medium | | [solution](<_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | @@ -120,8 +123,8 @@ Calculations are based on the date of the first solve. | 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | | 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<_287. Find the Duplicate Number.md>) | c | Jun 25, 2024 | | 142 | [Linked List Cycle II]() | Medium | | [solution](<_142. Linked List Cycle II.md>) | py | Jun 25, 2024 | -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | Jun 24, 2024 | +| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<_1641. Count Sorted Vowel Strings.md>) | c, java, cpp | Jun 24, 2024 | +| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<_2317. Maximum XOR After Operations .md>) | c, java, py, cpp | Jun 24, 2024 | | 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | | 1669 | [Merge In Between Linked Lists]() | Medium | | [solution](<_1669. Merge In Between Linked Lists.md>) | c | Jun 24, 2024 | | 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | @@ -130,7 +133,7 @@ Calculations are based on the date of the first solve. | 1905 | [Count Sub Islands]() | Medium | | [solution](<_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | | 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | | 695 | [Max Area of Island]() | Medium | N150 | [solution](<_695. Max Area of Island.md>) | c | Jun 23, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<_419. Battleships in a Board.md>) | py, c | Jun 23, 2024 | +| 419 | [Battleships in a Board]() | Medium | | [solution](<_419. Battleships in a Board.md>) | c, py | Jun 23, 2024 | | 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | | 1973 | [Count Nodes Equal to Sum of Descendants]() | Medium | | [solution](<_1973. Count Nodes Equal to Sum of Descendants.md>) | c | Jun 23, 2024 | | 1026 | [Maximum Difference Between Node and Ancestor]() | Medium | | [solution](<_1026. Maximum Difference Between Node and Ancestor.md>) | py | Jun 23, 2024 | @@ -140,7 +143,7 @@ Calculations are based on the date of the first solve. | 2405 | [Optimal Partition of String]() | Medium | | [solution](<_2405. Optimal Partition of String.md>) | py | Jun 23, 2024 | | 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | +| 98 | [Validate Binary Search Tree]() | Medium | N150, B75 | [solution](<_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | | 50 | [Pow(x, n)]() | Medium | N150 | [solution](<_50. Pow(x, n).md>) | c, java, py | Jun 22, 2024 | | 3196 | w contest 403 - q3 | Medium | Contest | [solution](<_3196. w contest 403 - q.md>) | py | Jun 22, 2024 | | 3195 | w contest 403 - q2 | Medium | Contest | [solution](<_3195. w contest 403 - q.md>) | py | Jun 22, 2024 | @@ -152,7 +155,7 @@ Calculations are based on the date of the first solve. | 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | | 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers]() | Medium | | [solution](<_1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.md>) | c, java | Jun 22, 2024 | | 1874 | [Minimize Product Sum of Two Arrays]() | Medium | | [solution](<_1874. Minimize Product Sum of Two Arrays.md>) | c, java | Jun 22, 2024 | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<_2743. Count Substrings Without Repeating Character.md>) | py, java | Jun 21, 2024 | +| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 21, 2024 | | 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | | 382 | [Linked List Random Node]() | Medium | | [solution](<_382. Linked List Random Node.md>) | c, java, py | Jun 21, 2024 | | 328 | [Odd Even Linked List]() | Medium | | [solution](<_328. Odd Even Linked List.md>) | py | Jun 21, 2024 | @@ -168,19 +171,19 @@ Calculations are based on the date of the first solve. | 977 | [Squares of a Sorted Array]() | Easy | | [solution](<_977. Squares of a Sorted Array.md>) | py | Jun 20, 2024 | | 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution](<_1552. Magnetic Force Between Two Balls.md>) | py | Jun 20, 2024 | | 1482 | [Minimum Number of Days to Make m Bouquets]() | Medium | | [solution](<_1482. Minimum Number of Days to Make m Bouquets.md>) | py | Jun 18, 2024 | -| 57 | [Insert Interval]() | Medium | B75, N150 | [solution](<_57. Insert Interval.md>) | py | Jun 18, 2024 | -| 56 | [Merge Intervals]() | Medium | B75, N150 | [solution](<_56. Merge Intervals.md>) | py | Jun 18, 2024 | +| 57 | [Insert Interval]() | Medium | N150, B75 | [solution](<_57. Insert Interval.md>) | py | Jun 18, 2024 | +| 56 | [Merge Intervals]() | Medium | N150, B75 | [solution](<_56. Merge Intervals.md>) | py | Jun 18, 2024 | | 856 | [Score of Parentheses]() | Medium | | [solution](<_856. Score of Parentheses.md>) | py | Jun 17, 2024 | | 1209 | [Remove All Adjacent Duplicates in String II]() | Medium | | [solution](<_1209. Remove All Adjacent Duplicates in String II.md>) | py | Jun 17, 2024 | | 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<_826. Most Profit Assigning Work.md>) | py | Jun 17, 2024 | | 2374 | [Node With Highest Edge Score]() | Medium | | [solution](<_2374. Node With Highest Edge Score.md>) | py | Jun 17, 2024 | | 451 | [Sort Characters By Frequency]() | Medium | | [solution](<_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | +| 23 | [Merge k Sorted Lists]() | Hard | N150, B75 | [solution](<_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | | 509 | [Fibonacci Number]() | Easy | | [solution](<_509. Fibonacci Number.md>) | c | Jun 16, 2024 | | 1909 | [Remove One Element to Make the Array Strictly Increasing]() | Easy | | [solution](<_1909. Remove One Element to Make the Array Strictly Increasing.md>) | c | Jun 16, 2024 | | 2423 | [Remove Letter To Equalize Frequency]() | Easy | | [solution](<_2423. Remove Letter To Equalize Frequency.md>) | py | Jun 16, 2024 | | 663 | [Equal Tree Partition]() | Medium | Daily | [solution](<_663. Equal Tree Partition.md>) | py | Jun 16, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<_200. Number of Islands.md>) | py | Jun 16, 2024 | +| 200 | [Number of Islands]() | Medium | N150, B75 | [solution](<_200. Number of Islands.md>) | py | Jun 16, 2024 | | 330 | [Patching Array]() | Hard | Daily | [solution](<_330. Patching Array.md>) | py | Jun 15, 2024 | | 3186 | w contest 402 - q3 | Medium | Contest | [solution](<_3186. w contest 402 - q.md>) | py | Jun 15, 2024 | | 3185 | w contest 402 - q2 | Medium | Contest | [solution](<_3185. w contest 402 - q.md>) | py | Jun 15, 2024 | @@ -198,31 +201,31 @@ Calculations are based on the date of the first solve. | 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution](<_1580. Put Boxes Into the Warehouse II.md>) | py | Jun 14, 2024 | | 502 | [IPO]() | Hard | Daily | [solution](<_502. IPO.md>) | py | Jun 14, 2024 | | 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<_74. Search a 2D Matrix.md>) | py | Jun 14, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<_48. Rotate Image.md>) | c, py | Jun 14, 2024 | +| 48 | [Rotate Image]() | Medium | N150, B75 | [solution](<_48. Rotate Image.md>) | c, py | Jun 14, 2024 | | 867 | [Transpose Matrix]() | Easy | | [solution](<_867. Transpose Matrix.md>) | py | Jun 14, 2024 | | 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution](<_945. Minimum Increment to Make Array Unique.md>) | py | Jun 13, 2024 | | 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 13, 2024 | | 853 | [Car Fleet]() | Medium | N150 | [solution](<_853. Car Fleet.md>) | py | Jun 13, 2024 | | 665 | [Non-decreasing Array]() | Medium | | [solution](<_665. Non-decreasing Array.md>) | java, py | Jun 13, 2024 | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<_739. Daily Temperatures.md>) | java, c, py | Jun 13, 2024 | +| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<_739. Daily Temperatures.md>) | c, java, py | Jun 13, 2024 | | 22 | [Generate Parentheses]() | Medium | N150 | [solution](<_22. Generate Parentheses.md>) | py | Jun 13, 2024 | | 36 | [Valid Sudoku]() | Medium | N150 | [solution](<_36. Valid Sudoku.md>) | py | Jun 13, 2024 | | 155 | [Min Stack]() | Medium | N150 | [solution](<_155. Min Stack.md>) | py | Jun 13, 2024 | -| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution](<_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | -| 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution](<_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | -| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution](<_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<_49. Group Anagrams.md>) | py | Jun 12, 2024 | -| 242 | [Valid Anagram]() | Easy | B75, N150 | [solution](<_242. Valid Anagram.md>) | py, c | Jun 12, 2024 | -| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution](<_1551. Minimum Operations to Make Array Equal.md>) | py, c, java, rb, kt, rs, js | Jun 12, 2024 | +| 128 | [Longest Consecutive Sequence]() | Medium | N150, B75 | [solution](<_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | +| 238 | [Product of Array Except Self]() | Medium | N150, B75 | [solution](<_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | +| 271 | [Encode and Decode Strings]() | Medium | N150, B75 | [solution](<_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 49 | [Group Anagrams]() | Medium | N150, B75 | [solution](<_49. Group Anagrams.md>) | py | Jun 12, 2024 | +| 242 | [Valid Anagram]() | Easy | N150, B75 | [solution](<_242. Valid Anagram.md>) | c, py | Jun 12, 2024 | +| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution](<_1551. Minimum Operations to Make Array Equal.md>) | kt, java, c, rb, py, rs, js | Jun 12, 2024 | | 2807 | [Insert Greatest Common Divisors in Linked List]() | Medium | | [solution](<_2807. Insert Greatest Common Divisors in Linked List.md>) | py | Jun 12, 2024 | -| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | py, java | Jun 11, 2024 | +| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | java, py | Jun 11, 2024 | | 366 | [Find Leaves of Binary Tree]() | Medium | | [solution](<_366. Find Leaves of Binary Tree.md>) | py | Jun 11, 2024 | | 654 | [Maximum Binary Tree]() | Medium | | [solution](<_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | | 1315 | [Sum of Nodes with Even-Valued Grandparent]() | Medium | | [solution](<_1315. Sum of Nodes with Even-Valued Grandparent.md>) | py | Jun 11, 2024 | -| 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution](<_217. Contains Duplicate.md>) | py | Jun 11, 2024 | +| 217 | [Contains Duplicate]() | Easy | N150, B75 | [solution](<_217. Contains Duplicate.md>) | py | Jun 11, 2024 | | 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<_75. Sort Colors.md>) | py, c | Jun 11, 2024 | +| 75 | [Sort Colors]() | Medium | Daily | [solution](<_75. Sort Colors.md>) | c, py | Jun 11, 2024 | | 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | | 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | | 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution](<_950. Reveal Cards In Increasing Order.md>) | py | Jun 11, 2024 | @@ -231,16 +234,16 @@ Calculations are based on the date of the first solve. | 1006 | [Clumsy Factorial]() | Medium | | [solution](<_1006. Clumsy Factorial.md>) | c, py | Jun 11, 2024 | | 921 | [Minimum Add to Make Parentheses Valid]() | Medium | | [solution](<_921. Minimum Add to Make Parentheses Valid.md>) | java, py | Jun 11, 2024 | | 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<_1122. Relative Sort Array.md>) | py, java | Jun 10, 2024 | +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | | 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution](<_84. Largest Rectangle in Histogram.md>) | py | Jun 10, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<_143. Reorder List.md>) | java, py | Jun 10, 2024 | +| 143 | [Reorder List]() | Medium | N150, B75 | [solution](<_143. Reorder List.md>) | java, py | Jun 10, 2024 | | 71 | [Simplify Path]() | Medium | | [solution](<_71. Simplify Path.md>) | py | Jun 10, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<_114. Flatten Binary Tree to Linked List.md>) | py, c | Jun 10, 2024 | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | | 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution](<_150. Evaluate Reverse Polish Notation.md>) | py | Jun 10, 2024 | | 273 | [Integer to English Words]() | Hard | | [solution](<_273. Integer to English Words.md>) | py | Jun 10, 2024 | | 8 | [String to Integer (atoi)]() | Medium | | [solution](<_8. String to Integer (atoi).md>) | py | Jun 10, 2024 | | 1759 | [Count Number of Homogenous Substrings]() | Medium | | [solution](<_1759. Count Number of Homogenous Substrings.md>) | c, java | Jun 10, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<_2083. Substrings That Begin and End With the Same Letter.md>) | py, c | Jun 10, 2024 | +| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | | 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | | 224 | [Basic Calculator]() | Hard | | [solution](<_224. Basic Calculator.md>) | py | Jun 10, 2024 | | 227 | [Basic Calculator II]() | Medium | | [solution](<_227. Basic Calculator II.md>) | py | Jun 10, 2024 | @@ -250,9 +253,9 @@ Calculations are based on the date of the first solve. | 861 | [Score After Flipping Matrix]() | Medium | | [solution](<_861. Score After Flipping Matrix.md>) | c, py | Jun 09, 2024 | | 1051 | [Height Checker]() | Easy | Daily | [solution](<_1051. Height Checker.md>) | c, py | Jun 09, 2024 | | 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 09, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<_2396. Strictly Palindromic Number.md>) | py, c, java, rb, kt, rs, cpp, js | Jun 09, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<_974. Subarray Sums Divisible by K.md>) | py, java | Jun 09, 2024 | -| 3180 | w contest 401 - q3 | Medium | Contest | [solution](<_3180. w contest 401 - q.md>) | py, c | Jun 08, 2024 | +| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<_2396. Strictly Palindromic Number.md>) | kt, java, cpp, c, rb, py, rs, js | Jun 09, 2024 | +| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | +| 3180 | w contest 401 - q3 | Medium | Contest | [solution](<_3180. w contest 401 - q.md>) | c, py | Jun 08, 2024 | | 3179 | w contest 401 - q2 | Medium | Contest | [solution](<_3179. w contest 401 - q.md>) | py | Jun 08, 2024 | | 3178 | w contest 401 - q1 | Easy | Contest | [solution](<_3178. w contest 401 - q.md>) | py | Jun 08, 2024 | | 692 | [Top K Frequent Words]() | Medium | | [solution](<_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | @@ -270,7 +273,7 @@ Calculations are based on the date of the first solve. | 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution](<_129. Sum Root to Leaf Numbers.md>) | py | Jun 07, 2024 | | 69 | [Sqrt(x)]() | Easy | | [solution](<_69. Sqrt(x).md>) | py | Jun 07, 2024 | | 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | -| 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution](<_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | +| 125 | [Valid Palindrome]() | Easy | N150, B75 | [solution](<_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | | 196 | [Delete Duplicate Emails]() | Easy | | [solution](<_196. Delete Duplicate Emails.md>) | py, sql | Jun 07, 2024 | | 2482 | [Difference Between Ones and Zeros in Row and Column]() | Medium | | [solution](<_2482. Difference Between Ones and Zeros in Row and Column.md>) | py | Jun 07, 2024 | | 2265 | [Count Nodes Equal to Average of Subtree]() | Medium | | [solution](<_2265. Count Nodes Equal to Average of Subtree.md>) | py | Jun 07, 2024 | @@ -282,11 +285,11 @@ Calculations are based on the date of the first solve. | 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution](<_1721. Swapping Nodes in a Linked List.md>) | c | Jun 06, 2024 | | 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution](<_2095. Delete the Middle Node of a Linked List.md>) | c, java | Jun 06, 2024 | | 1474 | [Delete N Nodes After M Nodes of a Linked List]() | Easy | | [solution](<_1474. Delete N Nodes After M Nodes of a Linked List.md>) | c, java | Jun 06, 2024 | -| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution](<_19. Remove Nth Node From End of List.md>) | py, c, java | Jun 06, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<_648. Replace Words.md>) | py, java | Jun 06, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<_1570. Dot Product of Two Sparse Vectors.md>) | py, java, c | Jun 06, 2024 | +| 19 | [Remove Nth Node From End of List]() | Medium | N150, B75 | [solution](<_19. Remove Nth Node From End of List.md>) | c, java, py | Jun 06, 2024 | +| 648 | [Replace Words]() | Medium | Daily | [solution](<_648. Replace Words.md>) | java, py | Jun 06, 2024 | +| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | | 3064 | [Guess the Number Using Bitwise Questions I]() | Medium | | [solution](<_3064. Guess the Number Using Bitwise Questions I.md>) | c, py | Jun 06, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<_1265. Print Immutable Linked List in Reverse.md>) | py, c | Jun 06, 2024 | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | | 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution](<_1684. Count the Number of Consistent Strings.md>) | c, py | Jun 06, 2024 | | 1748 | [Sum of Unique Elements]() | Easy | | [solution](<_1748. Sum of Unique Elements.md>) | c | Jun 06, 2024 | | 1822 | [Sign of the Product of an Array]() | Easy | | [solution](<_1822. Sign of the Product of an Array.md>) | c | Jun 06, 2024 | @@ -299,19 +302,19 @@ Calculations are based on the date of the first solve. | 1502 | [Can Make Arithmetic Progression From Sequence]() | Easy | | [solution](<_1502. Can Make Arithmetic Progression From Sequence.md>) | c, py | Jun 04, 2024 | | 1046 | [Last Stone Weight]() | Easy | N150 | [solution](<_1046. Last Stone Weight.md>) | py | Jun 03, 2024 | | 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<_141. Linked List Cycle.md>) | py, c | Jun 03, 2024 | +| 141 | [Linked List Cycle]() | Easy | N150, B75 | [solution](<_141. Linked List Cycle.md>) | c, py | Jun 03, 2024 | | 409 | [Longest Palindrome]() | Easy | Daily | [solution](<_409. Longest Palindrome.md>) | c, py | Jun 03, 2024 | | 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | +| 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution](<_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | | 66 | [Plus One]() | Easy | N150 | [solution](<_66. Plus One.md>) | c | Jun 03, 2024 | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<_543. Diameter of Binary Tree.md>) | java, c, py | Jun 03, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<_2037. Minimum Number of Moves to Seat Everyone.md>) | py, c | Jun 03, 2024 | +| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<_543. Diameter of Binary Tree.md>) | c, java, py | Jun 03, 2024 | +| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | | 1736 | [Latest Time by Replacing Hidden Digits]() | Easy | | [solution](<_1736. Latest Time by Replacing Hidden Digits.md>) | c | Jun 03, 2024 | | 2942 | [Find Words Containing Character]() | Easy | | [solution](<_2942. Find Words Containing Character.md>) | c | Jun 03, 2024 | | 1470 | [Shuffle the Array]() | Easy | | [solution](<_1470. Shuffle the Array.md>) | c | Jun 03, 2024 | | 2011 | [Final Value of Variable After Performing Operations]() | Easy | | [solution](<_2011. Final Value of Variable After Performing Operations.md>) | c | Jun 03, 2024 | | 1929 | [Concatenation of Array]() | Easy | | [solution](<_1929. Concatenation of Array.md>) | c, java, py | Jun 03, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<_2486. Append Characters to String to Make Subsequence.md>) | py, c, java | Jun 03, 2024 | +| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | | 374 | [Guess Number Higher or Lower]() | Easy | | [solution](<_374. Guess Number Higher or Lower.md>) | java, py | Jun 02, 2024 | | 771 | [Jewels and Stones]() | Easy | | [solution](<_771. Jewels and Stones.md>) | java, py | Jun 02, 2024 | | 189 | [Rotate Array]() | Medium | | [solution](<_189. Rotate Array.md>) | py | Jun 02, 2024 | @@ -332,7 +335,7 @@ Calculations are based on the date of the first solve. | 1436 | [Destination City]() | Easy | | [solution](<_1436. Destination City.md>) | java | Jun 01, 2024 | | 645 | [Set Mismatch]() | Easy | | [solution](<_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | | 744 | [Find Smallest Letter Greater Than Target]() | Easy | | [solution](<_744. Find Smallest Letter Greater Than Target.md>) | java, py | Jun 01, 2024 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<_1940. Longest Common Subsequence Between Sorted Arrays.md>) | py, java | Jun 01, 2024 | +| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<_1940. Longest Common Subsequence Between Sorted Arrays.md>) | java, py | Jun 01, 2024 | | 3110 | [Score of a String]() | Easy | Daily | [solution](<_3110. Score of a String.md>) | java, py | May 31, 2024 | | 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | | 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution](<_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 | @@ -353,11 +356,11 @@ Calculations are based on the date of the first solve. | 3074 | [Apple Redistribution into Boxes]() | Easy | | [solution](<_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 | | 2678 | [Number of Senior Citizens]() | Easy | | [solution](<_2678. Number of Senior Citizens.md>) | java | May 22, 2024 | | 2679 | [Sum in a Matrix]() | Medium | | [solution](<_2679. Sum in a Matrix.md>) | java | May 22, 2024 | -| 1 | [Two Sum]() | Easy | B75, N150 | [solution](<_1. Two Sum.md>) | java, py | May 22, 2024 | +| 1 | [Two Sum]() | Easy | N150, B75 | [solution](<_1. Two Sum.md>) | java, py | May 22, 2024 | | 2 | [Add Two Numbers]() | Medium | N150 | [solution](<_2. Add Two Numbers.md>) | java | May 22, 2024 | -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution](<_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | -| 20 | [Valid Parentheses]() | Easy | B75, N150 | [solution](<_20. Valid Parentheses.md>) | java | May 22, 2024 | -| 21 | [Merge Two Sorted Lists]() | Easy | B75, N150 | [solution](<_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | +| 3 | [Longest Substring Without Repeating Characters]() | Medium | N150, B75 | [solution](<_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | +| 20 | [Valid Parentheses]() | Easy | N150, B75 | [solution](<_20. Valid Parentheses.md>) | java | May 22, 2024 | +| 21 | [Merge Two Sorted Lists]() | Easy | N150, B75 | [solution](<_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | | 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution](<_26. Remove Duplicates from Sorted Array.md>) | java | May 22, 2024 | | 175 | [Combine Two Tables]() | Easy | | [solution](<_175. Combine Two Tables.md>) | py, sql | May 22, 2024 | | 577 | [Employee Bonus]() | Easy | | [solution](<_577. Employee Bonus.md>) | sql | May 22, 2024 | @@ -374,7 +377,7 @@ Calculations are based on the date of the first solve. | 2894 | [Divisible and Non-divisible Sums Difference]() | Easy | | [solution](<_2894. Divisible and Non-divisible Sums Difference.md>) | py | May 22, 2024 | | 118 | [Pascal's Triangle]() | Easy | | [solution](<_118. Pascal's Triangle.md>) | py | May 22, 2024 | | 611 | [Valid Triangle Number]() | Medium | | [solution](<_611. Valid Triangle Number.md>) | py | May 22, 2024 | -| 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution](<_70. Climbing Stairs.md>) | py | May 22, 2024 | +| 70 | [Climbing Stairs]() | Easy | N150, B75 | [solution](<_70. Climbing Stairs.md>) | py | May 22, 2024 | | 251 | [Flatten 2D Vector]() | Medium | | [solution](<_251. Flatten 2D Vector.md>) | py | May 22, 2024 | | 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | | 14 | [Longest Common Prefix]() | Easy | | [solution](<_14. Longest Common Prefix.md>) | java | May 22, 2024 | diff --git a/markdowns/Topics.md b/markdowns/Topics.md index 9c93c5e2..6a34a87b 100644 --- a/markdowns/Topics.md +++ b/markdowns/Topics.md @@ -4,27 +4,27 @@ ------ -- [Array]() (171 completed) +- [Array]() (172 completed) +- [String]() (85 completed) - [Hash Table]() (83 completed) -- [String]() (83 completed) - [Depth-First Search]() (65 completed) - [Tree]() (60 completed) - [Binary Tree]() (55 completed) - [Sorting]() (54 completed) - [Math]() (46 completed) - [Breadth-First Search]() (43 completed) -- [Two Pointers]() (41 completed) +- [Two Pointers]() (43 completed) - [Linked List]() (37 completed) - [Stack]() (34 completed) - [Greedy]() (30 completed) - [Matrix]() (28 completed) - [Simulation]() (24 completed) - [Bit Manipulation]() (23 completed) +- [Dynamic Programming]() (19 completed) - [Database]() (18 completed) - [Trie]() (18 completed) - [Binary Search]() (17 completed) - [Design]() (17 completed) -- [Dynamic Programming]() (16 completed) - [Heap (Priority Queue)]() (15 completed) - [Recursion]() (14 completed) - [Backtracking]() (13 completed) diff --git a/markdowns/_5. Longest Palindromic Substring.md b/markdowns/_5. Longest Palindromic Substring.md new file mode 100644 index 00000000..e76fe38f --- /dev/null +++ b/markdowns/_5. Longest Palindromic Substring.md @@ -0,0 +1,97 @@ +# 5. [Longest Palindromic Substring]() + +*[Back to top](<../README.md>)* + +------ + +> *First completed : July 04, 2024* +> +> *Last updated : July 04, 2024* + + +------ + +> **Related Topics** : **Two Pointers, String, Dynamic Programming** +> +> **Acceptance Rate** : **33.984 %** + + +------ + +*To see the question prompt, click the title.* + +> ***Version 1*** is severly inefficient since it checks each pair of indicies, reasulting in at +> least $O(n^2)$ runtime. On top of that, the inside of the nested loop has another for loop +> to check whether the substring is a palindrome. This would make the runtime increase further +> to a worst case leaning towards $O(n^3)$. While it does avoid redundant cases (i.e.) substrings +> of a length that wouldn't improve the current record, it's still a major negative. +> +>
+> +> ***Version 2*** on the other hand avoids this by starting from the centre of each potential palindrome. +> It iterates through the string twice, once where it assumes the centre is a single character (and thus at +> least a palindrome of length $n$) and again where the indices $i$ and $i+1$ are used as the centre. In effect, +> it's checking odd and even length palindromes. This ends up being comfortably $O(n^2)$; a much greater improvement +> as compared to *Version 1*. + +------ + +## Solutions + +- [m5 v1 inefficient.py](<../my-submissions/m5 v1 inefficient.py>) +- [m5 v2 much better.py](<../my-submissions/m5 v2 much better.py>) +### Python +#### [m5 v1 inefficient.py](<../my-submissions/m5 v1 inefficient.py>) +```Python +class Solution: + def longestPalindrome(self, s: str) -> str: + longest = 0 + longsetS = '' + for i in range(len(s)) : + for j in range(len(s) - 1, i - 1, -1) : + if j - i + 1 <= longest : + continue + isPal = True + for k in range((j - i + 1) // 2) : + if s[i + k] != s[j - k] : + isPal = False + break + if isPal : + longest = j - i + 1 + longsetS = s[i: j+1] + + return longsetS +``` + +#### [m5 v2 much better.py](<../my-submissions/m5 v2 much better.py>) +```Python +class Solution: + def longestPalindrome(self, s: str) -> str: + longest = 0 + longsetS = '' + for i in range(len(s)) : + currOffset = 1 + while 0 <= i - currOffset and \ + i + currOffset < len(s) and \ + s[i - currOffset] == s[i + currOffset] : + currOffset += 1 + currOffset -= 1 + + if longest < currOffset * 2 + 1 : + longest = currOffset * 2 + 1 + longsetS = s[i - currOffset : i + currOffset + 1] + + for i in range(0, len(s) - 1) : + currOffset = 0 + while 0 <= i - currOffset and \ + i + currOffset + 1 < len(s) and \ + s[i - currOffset] == s[i + currOffset + 1] : + currOffset += 1 + + if longest < currOffset * 2 : + longest = currOffset * 2 + longsetS = s[i - currOffset + 1 : i + currOffset + 1] + + return longsetS +``` + diff --git a/markdowns/_647. Palindromic Substrings.md b/markdowns/_647. Palindromic Substrings.md new file mode 100644 index 00000000..4de570f3 --- /dev/null +++ b/markdowns/_647. Palindromic Substrings.md @@ -0,0 +1,52 @@ +# 647. [Palindromic Substrings]() + +*[Back to top](<../README.md>)* + +------ + +> *First completed : July 04, 2024* +> +> *Last updated : July 04, 2024* + + +------ + +> **Related Topics** : **Two Pointers, String, Dynamic Programming** +> +> **Acceptance Rate** : **70.244 %** + + +------ + +*To see the question prompt, click the title.* + +## Solutions + +- [m647.py](<../my-submissions/m647.py>) +### Python +#### [m647.py](<../my-submissions/m647.py>) +```Python +class Solution: + def countSubstrings(self, s: str) -> int: + counter = 0 + + for i in range(len(s)) : + offset = 0 + while 0 <= i - offset \ + and i + offset < len(s) \ + and s[i - offset] == s[i + offset] : + offset += 1 + counter += 1 + + for i in range(len(s) - 1) : + offset = 0 + while 0 <= i - offset \ + and i + offset + 1 < len(s) \ + and s[i - offset] == s[i + offset + 1] : + offset += 1 + counter += 1 + + return counter + +``` + diff --git a/markdowns/_746. Min Cost Climbing Stairs.md b/markdowns/_746. Min Cost Climbing Stairs.md new file mode 100644 index 00000000..b5964876 --- /dev/null +++ b/markdowns/_746. Min Cost Climbing Stairs.md @@ -0,0 +1,36 @@ +# 746. [Min Cost Climbing Stairs]() + +*[Back to top](<../README.md>)* + +------ + +> *First completed : July 04, 2024* +> +> *Last updated : July 04, 2024* + + +------ + +> **Related Topics** : **Array, Dynamic Programming** +> +> **Acceptance Rate** : **65.796 %** + + +------ + +*To see the question prompt, click the title.* + +## Solutions + +- [e746.py](<../my-submissions/e746.py>) +### Python +#### [e746.py](<../my-submissions/e746.py>) +```Python +class Solution: + def minCostClimbingStairs(self, cost: List[int]) -> int: + dp = [0] * 2 + [0] * len(cost) + for i, cost in enumerate(cost, 2) : + dp[i] = cost + min(dp[i - 1], dp[i - 2]) + return min(dp[-2:]) +``` + diff --git a/markdowns/by_topic/Array.md b/markdowns/by_topic/Array.md index 37d0ccf8..b1a01929 100644 --- a/markdowns/by_topic/Array.md +++ b/markdowns/by_topic/Array.md @@ -1,4 +1,4 @@ -# [Array]() (171 completed) +# [Array]() (172 completed) *[Back to top](<../../README.md>)* @@ -6,46 +6,46 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 1 | [Two Sum]() | Easy | B75, N150 | [solution](<../_1. Two Sum.md>) | java, py | May 22, 2024 | +| 1 | [Two Sum]() | Easy | N150, B75 | [solution](<../_1. Two Sum.md>) | java, py | May 22, 2024 | | 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution](<../_26. Remove Duplicates from Sorted Array.md>) | java | May 22, 2024 | | 27 | [Remove Element]() | Easy | | [solution](<../_27. Remove Element.md>) | java, py | Jun 02, 2024 | | 36 | [Valid Sudoku]() | Medium | N150 | [solution](<../_36. Valid Sudoku.md>) | py | Jun 13, 2024 | | 46 | [Permutations]() | Medium | N150 | [solution](<../_46. Permutations.md>) | py | Jun 07, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | -| 56 | [Merge Intervals]() | Medium | B75, N150 | [solution](<../_56. Merge Intervals.md>) | py | Jun 18, 2024 | -| 57 | [Insert Interval]() | Medium | B75, N150 | [solution](<../_57. Insert Interval.md>) | py | Jun 18, 2024 | +| 48 | [Rotate Image]() | Medium | N150, B75 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | +| 49 | [Group Anagrams]() | Medium | N150, B75 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | +| 56 | [Merge Intervals]() | Medium | N150, B75 | [solution](<../_56. Merge Intervals.md>) | py | Jun 18, 2024 | +| 57 | [Insert Interval]() | Medium | N150, B75 | [solution](<../_57. Insert Interval.md>) | py | Jun 18, 2024 | | 66 | [Plus One]() | Easy | N150 | [solution](<../_66. Plus One.md>) | c | Jun 03, 2024 | | 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<../_74. Search a 2D Matrix.md>) | py | Jun 14, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | py, c | Jun 11, 2024 | +| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | c, py | Jun 11, 2024 | | 78 | [Subsets]() | Medium | N150 | [solution](<../_78. Subsets.md>) | py | Jun 02, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | +| 79 | [Word Search]() | Medium | N150, B75 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | | 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution](<../_84. Largest Rectangle in Histogram.md>) | py | Jun 10, 2024 | | 90 | [Subsets II]() | Medium | N150 | [solution](<../_90. Subsets II.md>) | py | Jul 03, 2024 | | 118 | [Pascal's Triangle]() | Easy | | [solution](<../_118. Pascal's Triangle.md>) | py | May 22, 2024 | -| 121 | [Best Time to Buy and Sell Stock]() | Easy | B75, N150 | [solution](<../_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | -| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | +| 121 | [Best Time to Buy and Sell Stock]() | Easy | N150, B75 | [solution](<../_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | +| 128 | [Longest Consecutive Sequence]() | Medium | N150, B75 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | | 136 | [Single Number]() | Easy | N150 | [solution](<../_136. Single Number.md>) | py | Jul 03, 2024 | | 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution](<../_150. Evaluate Reverse Polish Notation.md>) | py | Jun 10, 2024 | | 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<../_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 13, 2024 | | 189 | [Rotate Array]() | Medium | | [solution](<../_189. Rotate Array.md>) | py | Jun 02, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | -| 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | -| 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution](<../_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | +| 200 | [Number of Islands]() | Medium | N150, B75 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | +| 212 | [Word Search II]() | Hard | N150, B75 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | +| 217 | [Contains Duplicate]() | Easy | N150, B75 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | +| 238 | [Product of Array Except Self]() | Medium | N150, B75 | [solution](<../_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | | 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | | 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | | 260 | [Single Number III]() | Medium | Daily | [solution](<../_260. Single Number III.md>) | py | May 30, 2024 | -| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | +| 271 | [Encode and Decode Strings]() | Medium | N150, B75 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | | 286 | [Walls and Gates]() | Medium | N150 | [solution](<../_286. Walls and Gates.md>) | py | Jun 14, 2024 | | 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<../_287. Find the Duplicate Number.md>) | c | Jun 25, 2024 | | 330 | [Patching Array]() | Hard | Daily | [solution](<../_330. Patching Array.md>) | py | Jun 15, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | | 353 | [Design Snake Game]() | Medium | | [solution](<../_353. Design Snake Game.md>) | py | Jun 28, 2024 | | 384 | [Shuffle an Array]() | Medium | | [solution](<../_384. Shuffle an Array.md>) | py | Jun 28, 2024 | | 414 | [Third Maximum Number]() | Easy | | [solution](<../_414. Third Maximum Number.md>) | py | May 23, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | py, c | Jun 23, 2024 | +| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | c, py | Jun 23, 2024 | | 475 | [Heaters]() | Medium | | [solution](<../_475. Heaters.md>) | py | Jun 07, 2024 | | 502 | [IPO]() | Hard | Daily | [solution](<../_502. IPO.md>) | py | Jun 14, 2024 | | 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution](<../_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 | @@ -54,7 +54,7 @@ | 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | | 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | | 645 | [Set Mismatch]() | Easy | | [solution](<../_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | py, java | Jun 06, 2024 | +| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | java, py | Jun 06, 2024 | | 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | | 665 | [Non-decreasing Array]() | Medium | | [solution](<../_665. Non-decreasing Array.md>) | java, py | Jun 13, 2024 | | 666 | [Path Sum IV]() | Medium | | [solution](<../_666. Path Sum IV.md>) | py | Jul 03, 2024 | @@ -62,8 +62,9 @@ | 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 23, 2024 | | 713 | [Subarray Product Less Than K]() | Medium | | [solution](<../_713. Subarray Product Less Than K.md>) | py | Jul 01, 2024 | | 720 | [Longest Word in Dictionary]() | Medium | | [solution](<../_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | java, c, py | Jun 13, 2024 | +| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | c, java, py | Jun 13, 2024 | | 744 | [Find Smallest Letter Greater Than Target]() | Easy | | [solution](<../_744. Find Smallest Letter Greater Than Target.md>) | java, py | Jun 01, 2024 | +| 746 | [Min Cost Climbing Stairs]() | Easy | N150 | [solution](<../_746. Min Cost Climbing Stairs.md>) | py | Jul 04, 2024 | | 758 | [Bold Words in String]() | Medium | | [solution](<../_758. Bold Words in String.md>) | py | Jun 27, 2024 | | 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<../_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | | 817 | [Linked List Components]() | Medium | | [solution](<../_817. Linked List Components.md>) | java | Jul 04, 2024 | @@ -81,12 +82,12 @@ | 946 | [Validate Stack Sequences]() | Medium | | [solution](<../_946. Validate Stack Sequences.md>) | c, py | Jun 11, 2024 | | 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution](<../_950. Reveal Cards In Increasing Order.md>) | py | Jun 11, 2024 | | 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | py, java | Jun 09, 2024 | +| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | | 977 | [Squares of a Sorted Array]() | Easy | | [solution](<../_977. Squares of a Sorted Array.md>) | py | Jun 20, 2024 | | 994 | [Rotting Oranges]() | Medium | N150 | [solution](<../_994. Rotting Oranges.md>) | py | Jun 14, 2024 | | 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | | 1002 | [Find Common Characters]() | Easy | Daily | [solution](<../_1002. Find Common Characters.md>) | py | Jun 04, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | java, cpp, c | Jun 26, 2024 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, java, cpp | Jun 26, 2024 | | 1018 | [Binary Prefix Divisible By 5]() | Easy | | [solution](<../_1018. Binary Prefix Divisible By 5.md>) | py | Jul 04, 2024 | | 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<../_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | | 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | @@ -95,7 +96,7 @@ | 1051 | [Height Checker]() | Easy | Daily | [solution](<../_1051. Height Checker.md>) | c, py | Jun 09, 2024 | | 1052 | [Grumpy Bookstore Owner]() | Medium | Daily | [solution](<../_1052. Grumpy Bookstore Owner.md>) | py | Jun 20, 2024 | | 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution](<../_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 03, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | py, java | Jun 10, 2024 | +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | | 1184 | [Distance Between Bus Stops]() | Easy | | [solution](<../_1184. Distance Between Bus Stops.md>) | py | May 31, 2024 | | 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution](<../_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 | | 1233 | [Remove Sub-Folders from the Filesystem]() | Medium | | [solution](<../_1233. Remove Sub-Folders from the Filesystem.md>) | py | Jun 27, 2024 | @@ -117,16 +118,16 @@ | 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | | 1482 | [Minimum Number of Days to Make m Bouquets]() | Medium | | [solution](<../_1482. Minimum Number of Days to Make m Bouquets.md>) | py | Jun 18, 2024 | | 1502 | [Can Make Arithmetic Progression From Sequence]() | Easy | | [solution](<../_1502. Can Make Arithmetic Progression From Sequence.md>) | c, py | Jun 04, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | py, cpp, c, java | Jul 02, 2024 | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, java, py, cpp | Jul 02, 2024 | | 1535 | [Find the Winner of an Array Game]() | Medium | | [solution](<../_1535. Find the Winner of an Array Game.md>) | py | Jun 08, 2024 | -| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<../_1550. Three Consecutive Odds.md>) | py, c | Jun 30, 2024 | +| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<../_1550. Three Consecutive Odds.md>) | c, py | Jun 30, 2024 | | 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution](<../_1552. Magnetic Force Between Two Balls.md>) | py | Jun 20, 2024 | | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | | 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution](<../_1564. Put Boxes Into the Warehouse I.md>) | py | Jun 14, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | py, java, c | Jun 06, 2024 | +| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | | 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution](<../_1580. Put Boxes Into the Warehouse II.md>) | py | Jun 14, 2024 | | 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution](<../_1684. Count the Number of Consistent Strings.md>) | c, py | Jun 06, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | py, java | Jul 02, 2024 | +| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | | 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution](<../_1700. Number of Students Unable to Eat Lunch.md>) | py | Jun 01, 2024 | | 1730 | [Shortest Path to Get Food]() | Medium | | [solution](<../_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 | | 1743 | [Restore the Array From Adjacent Pairs]() | Medium | | [solution](<../_1743. Restore the Array From Adjacent Pairs.md>) | py | Jun 26, 2024 | @@ -141,19 +142,19 @@ | 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | | 1909 | [Remove One Element to Make the Array Strictly Increasing]() | Easy | | [solution](<../_1909. Remove One Element to Make the Array Strictly Increasing.md>) | c | Jun 16, 2024 | | 1929 | [Concatenation of Array]() | Easy | | [solution](<../_1929. Concatenation of Array.md>) | c, java, py | Jun 03, 2024 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | py, java | Jun 01, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | py, c | Jun 26, 2024 | +| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | java, py | Jun 01, 2024 | +| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | | 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | | 2011 | [Final Value of Variable After Performing Operations]() | Easy | | [solution](<../_2011. Final Value of Variable After Performing Operations.md>) | c | Jun 03, 2024 | | 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | py, c | Jun 03, 2024 | +| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | | 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<../_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 09, 2024 | | 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution](<../_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 | | 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<../_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | | 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<../_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | | 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<../_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | | 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<../_2258. Escape the Spreading Fire.md>) | py | Jun 14, 2024 | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | Jun 24, 2024 | +| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, java, py, cpp | Jun 24, 2024 | | 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<../_2352. Equal Row and Column Pairs.md>) | py | Jun 26, 2024 | | 2365 | [Task Scheduler II]() | Medium | | [solution](<../_2365. Task Scheduler II.md>) | py | Jun 29, 2024 | | 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | @@ -169,11 +170,11 @@ | 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | | 2942 | [Find Words Containing Character]() | Easy | | [solution](<../_2942. Find Words Containing Character.md>) | c | Jun 03, 2024 | | 2954 | [Count the Number of Infection Sequences]() | Hard | | [solution](<../_2954. Count the Number of Infection Sequences.md>) | py | Jun 26, 2024 | -| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<../_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | py, java | Jun 11, 2024 | +| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<../_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | java, py | Jun 11, 2024 | | 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<../_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | | 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | | 3074 | [Apple Redistribution into Boxes]() | Easy | | [solution](<../_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 | | 3169 | w contest 400 - q2 | Medium | Contest | [solution](<../_3169. w contest 400 - q.md>) | py | Jun 01, 2024 | | 3175 | bw contest 132 - q2 | Medium | Contest | [solution](<../_3175. bw contest 132 - q.md>) | py | Jun 08, 2024 | | 3179 | w contest 401 - q2 | Medium | Contest | [solution](<../_3179. w contest 401 - q.md>) | py | Jun 08, 2024 | -| 3180 | w contest 401 - q3 | Medium | Contest | [solution](<../_3180. w contest 401 - q.md>) | py, c | Jun 08, 2024 | \ No newline at end of file +| 3180 | w contest 401 - q3 | Medium | Contest | [solution](<../_3180. w contest 401 - q.md>) | c, py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Backtracking.md b/markdowns/by_topic/Backtracking.md index cd1d5045..057034af 100644 --- a/markdowns/by_topic/Backtracking.md +++ b/markdowns/by_topic/Backtracking.md @@ -10,12 +10,12 @@ | 46 | [Permutations]() | Medium | N150 | [solution](<../_46. Permutations.md>) | py | Jun 07, 2024 | | 77 | [Combinations]() | Medium | | [solution](<../_77. Combinations.md>) | py | Jun 07, 2024 | | 78 | [Subsets]() | Medium | N150 | [solution](<../_78. Subsets.md>) | py | Jun 02, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | +| 79 | [Word Search]() | Medium | N150, B75 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | | 90 | [Subsets II]() | Medium | N150 | [solution](<../_90. Subsets II.md>) | py | Jul 03, 2024 | | 113 | [Path Sum II]() | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | +| 212 | [Word Search II]() | Hard | N150, B75 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | | 784 | [Letter Case Permutation]() | Medium | | [solution](<../_784. Letter Case Permutation.md>) | py | Jun 14, 2024 | | 1087 | [Brace Expansion]() | Medium | | [solution](<../_1087. Brace Expansion.md>) | py | Jun 14, 2024 | | 1239 | [Maximum Length of a Concatenated String with Unique Characters]() | Medium | | [solution](<../_1239. Maximum Length of a Concatenated String with Unique Characters.md>) | py | Jun 29, 2024 | | 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<../_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | py, c | Jun 26, 2024 | \ No newline at end of file +| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Binary Search Tree.md b/markdowns/by_topic/Binary Search Tree.md index e9e0c9dc..386623ae 100644 --- a/markdowns/by_topic/Binary Search Tree.md +++ b/markdowns/by_topic/Binary Search Tree.md @@ -6,15 +6,15 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------|:-------------|:----------------| -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | +| 98 | [Validate Binary Search Tree]() | Medium | N150, B75 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | | 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | +| 230 | [Kth Smallest Element in a BST]() | Medium | N150, B75 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | +| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | N150, B75 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | | 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | | 450 | [Delete Node in a BST]() | Medium | | [solution](<../_450. Delete Node in a BST.md>) | py | Jun 28, 2024 | | 776 | [Split BST]() | Medium | Weekly Premium | [solution](<../_776. Split BST.md>) | py | Jun 28, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | java, cpp, c | Jun 26, 2024 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, java, cpp | Jun 26, 2024 | | 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | | 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | | 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Binary Tree.md b/markdowns/by_topic/Binary Tree.md index afa25934..e736878b 100644 --- a/markdowns/by_topic/Binary Tree.md +++ b/markdowns/by_topic/Binary Tree.md @@ -7,24 +7,24 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------|:-------------|:----------------| | 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<../_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | +| 98 | [Validate Binary Search Tree]() | Medium | N150, B75 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | +| 100 | [Same Tree]() | Easy | N150, B75 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | +| 102 | [Binary Tree Level Order Traversal]() | Medium | N150, B75 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | | 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution](<../_103. Binary Tree Zigzag Level Order Traversal.md>) | py | Jul 03, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | +| 104 | [Maximum Depth of Binary Tree]() | Easy | N150, B75 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | | 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution](<../_107. Binary Tree Level Order Traversal II.md>) | java | Jul 03, 2024 | | 110 | [Balanced Binary Tree]() | Easy | N150 | [solution](<../_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 | | 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<../_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | | 112 | [Path Sum]() | Easy | | [solution](<../_112. Path Sum.md>) | py | Jul 03, 2024 | | 113 | [Path Sum II]() | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | py, c | Jun 10, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | +| 124 | [Binary Tree Maximum Path Sum]() | Hard | N150, B75 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | | 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution](<../_129. Sum Root to Leaf Numbers.md>) | py | Jun 07, 2024 | | 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | | 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<../_199. Binary Tree Right Side View.md>) | java, cpp | Jul 04, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | +| 226 | [Invert Binary Tree]() | Easy | N150, B75 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | +| 230 | [Kth Smallest Element in a BST]() | Medium | N150, B75 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | +| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | N150, B75 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | | 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | | 366 | [Find Leaves of Binary Tree]() | Medium | | [solution](<../_366. Find Leaves of Binary Tree.md>) | py | Jun 11, 2024 | @@ -33,8 +33,8 @@ | 437 | [Path Sum III]() | Medium | | [solution](<../_437. Path Sum III.md>) | py | Jul 03, 2024 | | 450 | [Delete Node in a BST]() | Medium | | [solution](<../_450. Delete Node in a BST.md>) | py | Jun 28, 2024 | | 513 | [Find Bottom Left Tree Value]() | Medium | | [solution](<../_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | java, c, py | Jun 03, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | +| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | c, java, py | Jun 03, 2024 | +| 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | | 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<../_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | | 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | | 663 | [Equal Tree Partition]() | Medium | Daily | [solution](<../_663. Equal Tree Partition.md>) | py | Jun 16, 2024 | @@ -44,7 +44,7 @@ | 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<../_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | | 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | | 993 | [Cousins in Binary Tree]() | Easy | | [solution](<../_993. Cousins in Binary Tree.md>) | py | Jul 03, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | java, cpp, c | Jun 26, 2024 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, java, cpp | Jun 26, 2024 | | 1026 | [Maximum Difference Between Node and Ancestor]() | Medium | | [solution](<../_1026. Maximum Difference Between Node and Ancestor.md>) | py | Jun 23, 2024 | | 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution](<../_1028. Recover a Tree From Preorder Traversal.md>) | py | Jun 30, 2024 | | 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | diff --git a/markdowns/by_topic/Bit Manipulation.md b/markdowns/by_topic/Bit Manipulation.md index 0ec4054b..3b0700a7 100644 --- a/markdowns/by_topic/Bit Manipulation.md +++ b/markdowns/by_topic/Bit Manipulation.md @@ -9,7 +9,7 @@ | 78 | [Subsets]() | Medium | N150 | [solution](<../_78. Subsets.md>) | py | Jun 02, 2024 | | 90 | [Subsets II]() | Medium | N150 | [solution](<../_90. Subsets II.md>) | py | Jul 03, 2024 | | 136 | [Single Number]() | Easy | N150 | [solution](<../_136. Single Number.md>) | py | Jul 03, 2024 | -| 191 | [Number of 1 Bits]() | Easy | B75, N150 | [solution](<../_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | +| 191 | [Number of 1 Bits]() | Easy | N150, B75 | [solution](<../_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | | 260 | [Single Number III]() | Medium | Daily | [solution](<../_260. Single Number III.md>) | py | May 30, 2024 | | 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<../_287. Find the Duplicate Number.md>) | c | Jun 25, 2024 | | 645 | [Set Mismatch]() | Easy | | [solution](<../_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | @@ -25,7 +25,7 @@ | 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution](<../_1525. Number of Good Ways to Split a String.md>) | py | Jun 01, 2024 | | 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution](<../_1684. Count the Number of Consistent Strings.md>) | c, py | Jun 06, 2024 | | 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution](<../_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | Jun 24, 2024 | +| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, java, py, cpp | Jun 24, 2024 | | 2433 | [Find The Original Array of Prefix Xor]() | Medium | | [solution](<../_2433. Find The Original Array of Prefix Xor.md>) | py | May 30, 2024 | -| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<../_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | py, java | Jun 11, 2024 | +| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<../_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | java, py | Jun 11, 2024 | | 3064 | [Guess the Number Using Bitwise Questions I]() | Medium | | [solution](<../_3064. Guess the Number Using Bitwise Questions I.md>) | c, py | Jun 06, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Brainteaser.md b/markdowns/by_topic/Brainteaser.md index 24eabdaa..7e85ef77 100644 --- a/markdowns/by_topic/Brainteaser.md +++ b/markdowns/by_topic/Brainteaser.md @@ -7,4 +7,4 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------|:--------|:-------|:-------------------------------------------------------|:---------------------------------|:----------------| | 292 | [Nim Game]() | Easy | | [solution](<../_292. Nim Game.md>) | py | May 23, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | py, c, java, rb, kt, rs, cpp, js | Jun 09, 2024 | \ No newline at end of file +| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | kt, java, cpp, c, rb, py, rs, js | Jun 09, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Breadth-First Search.md b/markdowns/by_topic/Breadth-First Search.md index c041dbb5..16b794f7 100644 --- a/markdowns/by_topic/Breadth-First Search.md +++ b/markdowns/by_topic/Breadth-First Search.md @@ -6,16 +6,16 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------------------------------------------|:------------|:----------------| -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | +| 100 | [Same Tree]() | Easy | N150, B75 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | +| 102 | [Binary Tree Level Order Traversal]() | Medium | N150, B75 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | | 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution](<../_103. Binary Tree Zigzag Level Order Traversal.md>) | py | Jul 03, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | +| 104 | [Maximum Depth of Binary Tree]() | Easy | N150, B75 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | | 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution](<../_107. Binary Tree Level Order Traversal II.md>) | java | Jul 03, 2024 | | 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<../_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | | 112 | [Path Sum]() | Easy | | [solution](<../_112. Path Sum.md>) | py | Jul 03, 2024 | | 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<../_199. Binary Tree Right Side View.md>) | java, cpp | Jul 04, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | +| 200 | [Number of Islands]() | Medium | N150, B75 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | +| 226 | [Invert Binary Tree]() | Easy | N150, B75 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | | 286 | [Walls and Gates]() | Medium | N150 | [solution](<../_286. Walls and Gates.md>) | py | Jun 14, 2024 | | 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | | 339 | [Nested List Weight Sum]() | Medium | | [solution](<../_339. Nested List Weight Sum.md>) | c, py | Jul 02, 2024 | @@ -45,7 +45,7 @@ | 1730 | [Shortest Path to Get Food]() | Medium | | [solution](<../_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 | | 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | | 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | py, java | Jun 28, 2024 | +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | | 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<../_2258. Escape the Spreading Fire.md>) | py | Jun 14, 2024 | | 2385 | [Amount of Time for Binary Tree to Be Infected]() | Medium | | [solution](<../_2385. Amount of Time for Binary Tree to Be Infected.md>) | py | Jun 26, 2024 | | 2415 | [Reverse Odd Levels of Binary Tree]() | Medium | | [solution](<../_2415. Reverse Odd Levels of Binary Tree.md>) | py | Jun 23, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Bucket Sort.md b/markdowns/by_topic/Bucket Sort.md index b215a172..b5297fcb 100644 --- a/markdowns/by_topic/Bucket Sort.md +++ b/markdowns/by_topic/Bucket Sort.md @@ -6,6 +6,6 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |----:|:---------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------|:------------|:----------------| -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | | 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Combinatorics.md b/markdowns/by_topic/Combinatorics.md index 8e101087..45808855 100644 --- a/markdowns/by_topic/Combinatorics.md +++ b/markdowns/by_topic/Combinatorics.md @@ -6,7 +6,7 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------|:--------|:--------|:-------------------------------------------------------------------|:-------------|:----------------| -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 | +| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, java, cpp | Jun 24, 2024 | | 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<../_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | | 2954 | [Count the Number of Infection Sequences]() | Hard | | [solution](<../_2954. Count the Number of Infection Sequences.md>) | py | Jun 26, 2024 | | 3179 | w contest 401 - q2 | Medium | Contest | [solution](<../_3179. w contest 401 - q.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Counting Sort.md b/markdowns/by_topic/Counting Sort.md index 77ea4c0c..a9277cda 100644 --- a/markdowns/by_topic/Counting Sort.md +++ b/markdowns/by_topic/Counting Sort.md @@ -7,4 +7,4 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------|:--------|:-------|:-----------------------------------------------|:------------|:----------------| | 1051 | [Height Checker]() | Easy | Daily | [solution](<../_1051. Height Checker.md>) | c, py | Jun 09, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | py, java | Jun 10, 2024 | \ No newline at end of file +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Counting.md b/markdowns/by_topic/Counting.md index f2eafbb4..fec3a685 100644 --- a/markdowns/by_topic/Counting.md +++ b/markdowns/by_topic/Counting.md @@ -6,15 +6,15 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------|:------------|:----------------| -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | | 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | | 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution](<../_945. Minimum Increment to Make Array Unique.md>) | py | Jun 13, 2024 | | 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | | 1748 | [Sum of Unique Elements]() | Easy | | [solution](<../_1748. Sum of Unique Elements.md>) | c | Jun 06, 2024 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | py, java | Jun 01, 2024 | +| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | java, py | Jun 01, 2024 | | 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | py, c | Jun 10, 2024 | +| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | | 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution](<../_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 | | 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<../_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | | 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<../_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | diff --git a/markdowns/by_topic/Depth-First Search.md b/markdowns/by_topic/Depth-First Search.md index 281898ec..0436dac5 100644 --- a/markdowns/by_topic/Depth-First Search.md +++ b/markdowns/by_topic/Depth-First Search.md @@ -7,37 +7,37 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------|:------------|:----------------| | 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<../_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | +| 98 | [Validate Binary Search Tree]() | Medium | N150, B75 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | +| 100 | [Same Tree]() | Easy | N150, B75 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | +| 104 | [Maximum Depth of Binary Tree]() | Easy | N150, B75 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | | 110 | [Balanced Binary Tree]() | Easy | N150 | [solution](<../_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 | | 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<../_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | | 112 | [Path Sum]() | Easy | | [solution](<../_112. Path Sum.md>) | py | Jul 03, 2024 | | 113 | [Path Sum II]() | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | py, c | Jun 10, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | +| 124 | [Binary Tree Maximum Path Sum]() | Hard | N150, B75 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | | 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution](<../_129. Sum Root to Leaf Numbers.md>) | py | Jun 07, 2024 | | 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<../_199. Binary Tree Right Side View.md>) | java, cpp | Jul 04, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | +| 200 | [Number of Islands]() | Medium | N150, B75 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | +| 211 | [Design Add and Search Words Data Structure]() | Medium | N150, B75 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | +| 226 | [Invert Binary Tree]() | Easy | N150, B75 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | +| 230 | [Kth Smallest Element in a BST]() | Medium | N150, B75 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | +| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | N150, B75 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | | 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | | 339 | [Nested List Weight Sum]() | Medium | | [solution](<../_339. Nested List Weight Sum.md>) | c, py | Jul 02, 2024 | | 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | | 364 | [Nested List Weight Sum II]() | Medium | | [solution](<../_364. Nested List Weight Sum II.md>) | java, py | Jul 02, 2024 | | 366 | [Find Leaves of Binary Tree]() | Medium | | [solution](<../_366. Find Leaves of Binary Tree.md>) | py | Jun 11, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | py, c | Jun 23, 2024 | +| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | c, py | Jun 23, 2024 | | 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | | 430 | [Flatten a Multilevel Doubly Linked List]() | Medium | | [solution](<../_430. Flatten a Multilevel Doubly Linked List.md>) | java, cpp | Jun 26, 2024 | | 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<../_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | | 437 | [Path Sum III]() | Medium | | [solution](<../_437. Path Sum III.md>) | py | Jul 03, 2024 | | 513 | [Find Bottom Left Tree Value]() | Medium | | [solution](<../_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | java, c, py | Jun 03, 2024 | +| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | c, java, py | Jun 03, 2024 | | 565 | [Array Nesting]() | Medium | | [solution](<../_565. Array Nesting.md>) | py | Jul 02, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | +| 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | | 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<../_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | | 663 | [Equal Tree Partition]() | Medium | Daily | [solution](<../_663. Equal Tree Partition.md>) | py | Jun 16, 2024 | | 666 | [Path Sum IV]() | Medium | | [solution](<../_666. Path Sum IV.md>) | py | Jul 03, 2024 | @@ -67,7 +67,7 @@ | 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | | 1973 | [Count Nodes Equal to Sum of Descendants]() | Medium | | [solution](<../_1973. Count Nodes Equal to Sum of Descendants.md>) | c | Jun 23, 2024 | | 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | py, java | Jun 28, 2024 | +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | | 2265 | [Count Nodes Equal to Average of Subtree]() | Medium | | [solution](<../_2265. Count Nodes Equal to Average of Subtree.md>) | py | Jun 07, 2024 | | 2385 | [Amount of Time for Binary Tree to Be Infected]() | Medium | | [solution](<../_2385. Amount of Time for Binary Tree to Be Infected.md>) | py | Jun 26, 2024 | | 2415 | [Reverse Odd Levels of Binary Tree]() | Medium | | [solution](<../_2415. Reverse Odd Levels of Binary Tree.md>) | py | Jun 23, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Design.md b/markdowns/by_topic/Design.md index d2d44c75..6647747a 100644 --- a/markdowns/by_topic/Design.md +++ b/markdowns/by_topic/Design.md @@ -8,10 +8,10 @@ |-----:|:-------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:---------------------------------------------------------------------|:------------|:----------------| | 155 | [Min Stack]() | Medium | N150 | [solution](<../_155. Min Stack.md>) | py | Jun 13, 2024 | | 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | +| 208 | [Implement Trie (Prefix Tree)]() | Medium | N150, B75 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | +| 211 | [Design Add and Search Words Data Structure]() | Medium | N150, B75 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | | 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | -| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | +| 271 | [Encode and Decode Strings]() | Medium | N150, B75 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | | 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | | 353 | [Design Snake Game]() | Medium | | [solution](<../_353. Design Snake Game.md>) | py | Jun 28, 2024 | | 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<../_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | @@ -19,7 +19,7 @@ | 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | | 707 | [Design Linked List]() | Medium | | [solution](<../_707. Design Linked List.md>) | java | Jun 21, 2024 | | 1166 | [Design File System]() | Medium | | [solution](<../_1166. Design File System.md>) | py | Jun 27, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | py, java, c | Jun 06, 2024 | +| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | | 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<../_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | | 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | | 2671 | [Frequency Tracker]() | Medium | | [solution](<../_2671. Frequency Tracker.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Divide and Conquer.md b/markdowns/by_topic/Divide and Conquer.md index 90a016b0..56cb9673 100644 --- a/markdowns/by_topic/Divide and Conquer.md +++ b/markdowns/by_topic/Divide and Conquer.md @@ -6,9 +6,9 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------|:--------|:----------|:--------------------------------------------------------|:------------|:----------------| -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | -| 191 | [Number of 1 Bits]() | Easy | B75, N150 | [solution](<../_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 23 | [Merge k Sorted Lists]() | Hard | N150, B75 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | +| 191 | [Number of 1 Bits]() | Easy | N150, B75 | [solution](<../_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | | 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | | 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Dynamic Programming.md b/markdowns/by_topic/Dynamic Programming.md index eb2eebfa..5aeaa060 100644 --- a/markdowns/by_topic/Dynamic Programming.md +++ b/markdowns/by_topic/Dynamic Programming.md @@ -1,4 +1,4 @@ -# [Dynamic Programming]() (16 completed) +# [Dynamic Programming]() (19 completed) *[Back to top](<../../README.md>)* @@ -6,19 +6,22 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------------------------------|:-------------|:----------------| +| 5 | [Longest Palindromic Substring]() | Medium | N150, B75 | [solution](<../_5. Longest Palindromic Substring.md>) | py | Jul 04, 2024 | | 22 | [Generate Parentheses]() | Medium | N150 | [solution](<../_22. Generate Parentheses.md>) | py | Jun 13, 2024 | -| 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | +| 70 | [Climbing Stairs]() | Easy | N150, B75 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | | 118 | [Pascal's Triangle]() | Easy | | [solution](<../_118. Pascal's Triangle.md>) | py | May 22, 2024 | -| 121 | [Best Time to Buy and Sell Stock]() | Easy | B75, N150 | [solution](<../_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | +| 121 | [Best Time to Buy and Sell Stock]() | Easy | N150, B75 | [solution](<../_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | +| 124 | [Binary Tree Maximum Path Sum]() | Hard | N150, B75 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | | 392 | [Is Subsequence]() | Easy | | [solution](<../_392. Is Subsequence.md>) | java | Jun 21, 2024 | | 509 | [Fibonacci Number]() | Easy | | [solution](<../_509. Fibonacci Number.md>) | c | Jun 16, 2024 | | 542 | [01 Matrix]() | Medium | | [solution](<../_542. 01 Matrix.md>) | py | Jun 26, 2024 | +| 647 | [Palindromic Substrings]() | Medium | N150, B75 | [solution](<../_647. Palindromic Substrings.md>) | py | Jul 04, 2024 | | 651 | [4 Keys Keyboard]() | Medium | | [solution](<../_651. 4 Keys Keyboard.md>) | py | May 29, 2024 | +| 746 | [Min Cost Climbing Stairs]() | Easy | N150 | [solution](<../_746. Min Cost Climbing Stairs.md>) | py | Jul 04, 2024 | | 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution](<../_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 | | 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<../_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | | 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution](<../_1525. Number of Good Ways to Split a String.md>) | py | Jun 01, 2024 | -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | py, java | Jul 02, 2024 | +| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, java, cpp | Jun 24, 2024 | +| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | | 2086 | [Minimum Number of Food Buckets to Feed the Hamsters]() | Medium | | [solution](<../_2086. Minimum Number of Food Buckets to Feed the Hamsters.md>) | java | Jul 01, 2024 | -| 3180 | w contest 401 - q3 | Medium | Contest | [solution](<../_3180. w contest 401 - q.md>) | py, c | Jun 08, 2024 | \ No newline at end of file +| 3180 | w contest 401 - q3 | Medium | Contest | [solution](<../_3180. w contest 401 - q.md>) | c, py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Graph.md b/markdowns/by_topic/Graph.md index 389ae266..398e63ec 100644 --- a/markdowns/by_topic/Graph.md +++ b/markdowns/by_topic/Graph.md @@ -7,8 +7,8 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:--------------------------------------------------------------------------------------|:-----------------|:----------------| | 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable]() | Hard | Daily | [solution](<../_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md>) | py | Jun 30, 2024 | -| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<../_1791. Find Center of Star Graph.md>) | py, cpp, c, java | Jun 26, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | py, java | Jun 28, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | py, cpp, c, java | Jun 27, 2024 | +| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<../_1791. Find Center of Star Graph.md>) | c, java, py, cpp | Jun 26, 2024 | +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | +| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | c, java, py, cpp | Jun 27, 2024 | | 2374 | [Node With Highest Edge Score]() | Medium | | [solution](<../_2374. Node With Highest Edge Score.md>) | py | Jun 17, 2024 | | 2473 | [Minimum Cost to Buy Apples]() | Medium | | [solution](<../_2473. Minimum Cost to Buy Apples.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Greedy.md b/markdowns/by_topic/Greedy.md index 6bb25309..f0f70c78 100644 --- a/markdowns/by_topic/Greedy.md +++ b/markdowns/by_topic/Greedy.md @@ -18,7 +18,7 @@ | 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution](<../_945. Minimum Increment to Make Array Unique.md>) | py | Jun 13, 2024 | | 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | | 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | py, cpp, c, java | Jul 02, 2024 | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, java, py, cpp | Jul 02, 2024 | | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | | 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution](<../_1564. Put Boxes Into the Warehouse I.md>) | py | Jun 14, 2024 | | 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution](<../_1580. Put Boxes Into the Warehouse II.md>) | py | Jun 14, 2024 | @@ -27,12 +27,12 @@ | 1833 | [Maximum Ice Cream Bars]() | Medium | | [solution](<../_1833. Maximum Ice Cream Bars.md>) | c, java, py | Jun 23, 2024 | | 1874 | [Minimize Product Sum of Two Arrays]() | Medium | | [solution](<../_1874. Minimize Product Sum of Two Arrays.md>) | c, java | Jun 22, 2024 | | 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<../_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | py, c | Jun 03, 2024 | +| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | | 2086 | [Minimum Number of Food Buckets to Feed the Hamsters]() | Medium | | [solution](<../_2086. Minimum Number of Food Buckets to Feed the Hamsters.md>) | java | Jul 01, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | py, cpp, c, java | Jun 27, 2024 | +| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | c, java, py, cpp | Jun 27, 2024 | | 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | | 2405 | [Optimal Partition of String]() | Medium | | [solution](<../_2405. Optimal Partition of String.md>) | py | Jun 23, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | py, c, java | Jun 03, 2024 | +| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | | 2734 | [Lexicographically Smallest String After Substring Operation]() | Medium | | [solution](<../_2734. Lexicographically Smallest String After Substring Operation.md>) | py | Jun 29, 2024 | | 3074 | [Apple Redistribution into Boxes]() | Easy | | [solution](<../_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 | | 3106 | [Lexicographically Smallest String After Operations With Constraint]() | Medium | | [solution](<../_3106. Lexicographically Smallest String After Operations With Constraint.md>) | py | Jun 29, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Hash Function.md b/markdowns/by_topic/Hash Function.md index c12f17d0..54e8fe82 100644 --- a/markdowns/by_topic/Hash Function.md +++ b/markdowns/by_topic/Hash Function.md @@ -7,6 +7,6 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------|:--------|:----------|:---------------------------------------------------------------------|:------------|:----------------| | 535 | [Encode and Decode TinyURL]() | Medium | | [solution](<../_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | +| 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | | 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution](<../_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 01, 2024 | | 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Hash Table.md b/markdowns/by_topic/Hash Table.md index 00ac033e..c88d386f 100644 --- a/markdowns/by_topic/Hash Table.md +++ b/markdowns/by_topic/Hash Table.md @@ -6,20 +6,20 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:-------------------------------------------------------------------------------------------|:------------|:----------------| -| 1 | [Two Sum]() | Easy | B75, N150 | [solution](<../_1. Two Sum.md>) | java, py | May 22, 2024 | -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | +| 1 | [Two Sum]() | Easy | N150, B75 | [solution](<../_1. Two Sum.md>) | java, py | May 22, 2024 | +| 3 | [Longest Substring Without Repeating Characters]() | Medium | N150, B75 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | | 36 | [Valid Sudoku]() | Medium | N150 | [solution](<../_36. Valid Sudoku.md>) | py | Jun 13, 2024 | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | -| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | +| 49 | [Group Anagrams]() | Medium | N150, B75 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | +| 128 | [Longest Consecutive Sequence]() | Medium | N150, B75 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | | 138 | [Copy List with Random Pointer]() | Medium | N150 | [solution](<../_138. Copy List with Random Pointer.md>) | py | Jun 27, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<../_141. Linked List Cycle.md>) | py, c | Jun 03, 2024 | +| 141 | [Linked List Cycle]() | Easy | N150, B75 | [solution](<../_141. Linked List Cycle.md>) | c, py | Jun 03, 2024 | | 142 | [Linked List Cycle II]() | Medium | | [solution](<../_142. Linked List Cycle II.md>) | py | Jun 25, 2024 | | 166 | [Fraction to Recurring Decimal]() | Medium | | [solution](<../_166. Fraction to Recurring Decimal.md>) | py | May 31, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | -| 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | -| 242 | [Valid Anagram]() | Easy | B75, N150 | [solution](<../_242. Valid Anagram.md>) | py, c | Jun 12, 2024 | +| 208 | [Implement Trie (Prefix Tree)]() | Medium | N150, B75 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | +| 217 | [Contains Duplicate]() | Easy | N150, B75 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | +| 242 | [Valid Anagram]() | Easy | N150, B75 | [solution](<../_242. Valid Anagram.md>) | c, py | Jun 12, 2024 | | 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | | 353 | [Design Snake Game]() | Medium | | [solution](<../_353. Design Snake Game.md>) | py | Jun 28, 2024 | | 409 | [Longest Palindrome]() | Easy | Daily | [solution](<../_409. Longest Palindrome.md>) | c, py | Jun 03, 2024 | @@ -28,7 +28,7 @@ | 535 | [Encode and Decode TinyURL]() | Medium | | [solution](<../_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 | | 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | | 645 | [Set Mismatch]() | Easy | | [solution](<../_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | py, java | Jun 06, 2024 | +| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | java, py | Jun 06, 2024 | | 666 | [Path Sum IV]() | Medium | | [solution](<../_666. Path Sum IV.md>) | py | Jul 03, 2024 | | 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | | 690 | [Employee Importance]() | Medium | | [solution](<../_690. Employee Importance.md>) | java | Jul 02, 2024 | @@ -42,10 +42,10 @@ | 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<../_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | | 890 | [Find and Replace Pattern]() | Medium | | [solution](<../_890. Find and Replace Pattern.md>) | py | Jul 02, 2024 | | 930 | [Binary Subarrays With Sum]() | Medium | | [solution](<../_930. Binary Subarrays With Sum.md>) | py | Jun 21, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | py, java | Jun 09, 2024 | +| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | | 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | | 1002 | [Find Common Characters]() | Easy | Daily | [solution](<../_1002. Find Common Characters.md>) | py | Jun 04, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | py, java | Jun 10, 2024 | +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | | 1166 | [Design File System]() | Medium | | [solution](<../_1166. Design File System.md>) | py | Jun 27, 2024 | | 1171 | [Remove Zero Sum Consecutive Nodes from Linked List]() | Medium | | [solution](<../_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>) | py | Jun 15, 2024 | | 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution](<../_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 | @@ -59,7 +59,7 @@ | 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | | 1490 | [Clone N-ary Tree]() | Medium | | [solution](<../_1490. Clone N-ary Tree.md>) | java, py | Jun 01, 2024 | | 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution](<../_1525. Number of Good Ways to Split a String.md>) | py | Jun 01, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | py, java, c | Jun 06, 2024 | +| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | | 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<../_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 09, 2024 | | 1660 | [Correct a Binary Tree]() | Medium | | [solution](<../_1660. Correct a Binary Tree.md>) | py | Jun 26, 2024 | | 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Medium | | [solution](<../_1676. Lowest Common Ancestor of a Binary Tree IV.md>) | py | Jun 29, 2024 | @@ -69,10 +69,10 @@ | 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<../_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | | 1836 | [Remove Duplicates From an Unsorted Linked List]() | Medium | | [solution](<../_1836. Remove Duplicates From an Unsorted Linked List.md>) | py | Jul 04, 2024 | | 1852 | [Distinct Numbers in Each Subarray]() | Medium | | [solution](<../_1852. Distinct Numbers in Each Subarray.md>) | java | Jun 26, 2024 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | py, java | Jun 01, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | py, c | Jun 26, 2024 | +| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | java, py | Jun 01, 2024 | +| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | | 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | py, c | Jun 10, 2024 | +| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | | 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution](<../_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 | | 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<../_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | | 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<../_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | @@ -86,6 +86,6 @@ | 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<../_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | | 2610 | [Convert an Array Into a 2D Array With Conditions]() | Medium | | [solution](<../_2610. Convert an Array Into a 2D Array With Conditions.md>) | py | Jun 07, 2024 | | 2671 | [Frequency Tracker]() | Medium | | [solution](<../_2671. Frequency Tracker.md>) | py | Jun 28, 2024 | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | py, java | Jun 21, 2024 | +| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 21, 2024 | | 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<../_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | | 3174 | bw contest 132 - q1 | Easy | Contest | [solution](<../_3174. bw contest 132 - q.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Heap (Priority Queue).md b/markdowns/by_topic/Heap (Priority Queue).md index 4c118f3f..0c8d7c06 100644 --- a/markdowns/by_topic/Heap (Priority Queue).md +++ b/markdowns/by_topic/Heap (Priority Queue).md @@ -6,10 +6,10 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:------------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | +| 23 | [Merge k Sorted Lists]() | Hard | N150, B75 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | | 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | | 502 | [IPO]() | Hard | Daily | [solution](<../_502. IPO.md>) | py | Jun 14, 2024 | | 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | @@ -17,7 +17,7 @@ | 1046 | [Last Stone Weight]() | Easy | N150 | [solution](<../_1046. Last Stone Weight.md>) | py | Jun 03, 2024 | | 1268 | [Search Suggestions System]() | Medium | | [solution](<../_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | | 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | py, java | Jul 02, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | py, cpp, c, java | Jun 27, 2024 | +| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | +| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | c, java, py, cpp | Jun 27, 2024 | | 2473 | [Minimum Cost to Buy Apples]() | Medium | | [solution](<../_2473. Minimum Cost to Buy Apples.md>) | py | Jun 28, 2024 | | 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Linked List.md b/markdowns/by_topic/Linked List.md index 08e6efdc..32317fb2 100644 --- a/markdowns/by_topic/Linked List.md +++ b/markdowns/by_topic/Linked List.md @@ -7,19 +7,19 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------|:-----------------|:----------------| | 2 | [Add Two Numbers]() | Medium | N150 | [solution](<../_2. Add Two Numbers.md>) | java | May 22, 2024 | -| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution](<../_19. Remove Nth Node From End of List.md>) | py, c, java | Jun 06, 2024 | -| 21 | [Merge Two Sorted Lists]() | Easy | B75, N150 | [solution](<../_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | +| 19 | [Remove Nth Node From End of List]() | Medium | N150, B75 | [solution](<../_19. Remove Nth Node From End of List.md>) | c, java, py | Jun 06, 2024 | +| 21 | [Merge Two Sorted Lists]() | Easy | N150, B75 | [solution](<../_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | +| 23 | [Merge k Sorted Lists]() | Hard | N150, B75 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | | 24 | [Swap Nodes in Pairs]() | Medium | | [solution](<../_24. Swap Nodes in Pairs.md>) | c | Jun 06, 2024 | | 25 | [Reverse Nodes in k-Group]() | Hard | N150 | [solution](<../_25. Reverse Nodes in k-Group.md>) | c | Jun 06, 2024 | | 61 | [Rotate List]() | Medium | | [solution](<../_61. Rotate List.md>) | py | Jun 21, 2024 | | 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution](<../_82. Remove Duplicates from Sorted List II.md>) | py | Jul 04, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | py, c | Jun 10, 2024 | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | | 138 | [Copy List with Random Pointer]() | Medium | N150 | [solution](<../_138. Copy List with Random Pointer.md>) | py | Jun 27, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<../_141. Linked List Cycle.md>) | py, c | Jun 03, 2024 | +| 141 | [Linked List Cycle]() | Easy | N150, B75 | [solution](<../_141. Linked List Cycle.md>) | c, py | Jun 03, 2024 | | 142 | [Linked List Cycle II]() | Medium | | [solution](<../_142. Linked List Cycle II.md>) | py | Jun 25, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | -| 206 | [Reverse Linked List]() | Easy | B75, N150 | [solution](<../_206. Reverse Linked List.md>) | java | Jun 27, 2024 | +| 143 | [Reorder List]() | Medium | N150, B75 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | +| 206 | [Reverse Linked List]() | Easy | N150, B75 | [solution](<../_206. Reverse Linked List.md>) | java | Jun 27, 2024 | | 328 | [Odd Even Linked List]() | Medium | | [solution](<../_328. Odd Even Linked List.md>) | py | Jun 21, 2024 | | 369 | [Plus One Linked List]() | Medium | | [solution](<../_369. Plus One Linked List.md>) | c | Jul 04, 2024 | | 382 | [Linked List Random Node]() | Medium | | [solution](<../_382. Linked List Random Node.md>) | c, java, py | Jun 21, 2024 | @@ -31,7 +31,7 @@ | 817 | [Linked List Components]() | Medium | | [solution](<../_817. Linked List Components.md>) | java | Jul 04, 2024 | | 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<../_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | | 1171 | [Remove Zero Sum Consecutive Nodes from Linked List]() | Medium | | [solution](<../_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>) | py | Jun 15, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | py, c | Jun 06, 2024 | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | | 1474 | [Delete N Nodes After M Nodes of a Linked List]() | Easy | | [solution](<../_1474. Delete N Nodes After M Nodes of a Linked List.md>) | c, java | Jun 06, 2024 | | 1669 | [Merge In Between Linked Lists]() | Medium | | [solution](<../_1669. Merge In Between Linked Lists.md>) | c | Jun 24, 2024 | | 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution](<../_1721. Swapping Nodes in a Linked List.md>) | c | Jun 06, 2024 | @@ -39,7 +39,7 @@ | 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution](<../_2046. Sort Linked List Already Sorted Using Absolute Values.md>) | py | Jul 04, 2024 | | 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution](<../_2095. Delete the Middle Node of a Linked List.md>) | c, java | Jun 06, 2024 | | 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 20, 2024 | -| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<../_2181. Merge Nodes in Between Zeros.md>) | c, cpp, java, py | Jul 03, 2024 | +| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<../_2181. Merge Nodes in Between Zeros.md>) | c, java, py, cpp | Jul 03, 2024 | | 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<../_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | | 2807 | [Insert Greatest Common Divisors in Linked List]() | Medium | | [solution](<../_2807. Insert Greatest Common Divisors in Linked List.md>) | py | Jun 12, 2024 | | 2816 | [Double a Number Represented as a Linked List]() | Medium | | [solution](<../_2816. Double a Number Represented as a Linked List.md>) | c | Jul 04, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Math.md b/markdowns/by_topic/Math.md index e5b6a1b6..eef11d3e 100644 --- a/markdowns/by_topic/Math.md +++ b/markdowns/by_topic/Math.md @@ -9,11 +9,11 @@ | 2 | [Add Two Numbers]() | Medium | N150 | [solution](<../_2. Add Two Numbers.md>) | java | May 22, 2024 | | 7 | [Reverse Integer]() | Medium | N150 | [solution](<../_7. Reverse Integer.md>) | py | May 29, 2024 | | 9 | [Palindrome Number]() | Easy | | [solution](<../_9. Palindrome Number.md>) | java | May 22, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | +| 48 | [Rotate Image]() | Medium | N150, B75 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | | 50 | [Pow(x, n)]() | Medium | N150 | [solution](<../_50. Pow(x, n).md>) | c, java, py | Jun 22, 2024 | | 66 | [Plus One]() | Easy | N150 | [solution](<../_66. Plus One.md>) | c | Jun 03, 2024 | | 69 | [Sqrt(x)]() | Easy | | [solution](<../_69. Sqrt(x).md>) | py | Jun 07, 2024 | -| 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | +| 70 | [Climbing Stairs]() | Easy | N150, B75 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | | 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution](<../_150. Evaluate Reverse Polish Notation.md>) | py | Jun 10, 2024 | | 166 | [Fraction to Recurring Decimal]() | Medium | | [solution](<../_166. Fraction to Recurring Decimal.md>) | py | May 31, 2024 | | 189 | [Rotate Array]() | Medium | | [solution](<../_189. Rotate Array.md>) | py | Jun 02, 2024 | @@ -35,16 +35,16 @@ | 1252 | [Cells with Odd Values in a Matrix]() | Easy | | [solution](<../_1252. Cells with Odd Values in a Matrix.md>) | c | Jun 04, 2024 | | 1317 | [Convert Integer to the Sum of Two No-Zero Integers]() | Easy | | [solution](<../_1317. Convert Integer to the Sum of Two No-Zero Integers.md>) | c | Jun 04, 2024 | | 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution](<../_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>) | py | May 29, 2024 | -| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution](<../_1551. Minimum Operations to Make Array Equal.md>) | py, c, java, rb, kt, rs, js | Jun 12, 2024 | +| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution](<../_1551. Minimum Operations to Make Array Equal.md>) | kt, java, c, rb, py, rs, js | Jun 12, 2024 | | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 | +| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, java, cpp | Jun 24, 2024 | | 1759 | [Count Number of Homogenous Substrings]() | Medium | | [solution](<../_1759. Count Number of Homogenous Substrings.md>) | c, java | Jun 10, 2024 | | 1822 | [Sign of the Product of an Array]() | Easy | | [solution](<../_1822. Sign of the Product of an Array.md>) | c | Jun 06, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | py, c | Jun 10, 2024 | +| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | | 2165 | [Smallest Value of the Rearranged Number]() | Medium | | [solution](<../_2165. Smallest Value of the Rearranged Number.md>) | py | Jun 30, 2024 | | 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<../_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | Jun 24, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | py, c, java, rb, kt, rs, cpp, js | Jun 09, 2024 | +| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, java, py, cpp | Jun 24, 2024 | +| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | kt, java, cpp, c, rb, py, rs, js | Jun 09, 2024 | | 2455 | [Average Value of Even Numbers That Are Divisible by Three]() | Easy | | [solution](<../_2455. Average Value of Even Numbers That Are Divisible by Three.md>) | java | Jul 04, 2024 | | 2807 | [Insert Greatest Common Divisors in Linked List]() | Medium | | [solution](<../_2807. Insert Greatest Common Divisors in Linked List.md>) | py | Jun 12, 2024 | | 2816 | [Double a Number Represented as a Linked List]() | Medium | | [solution](<../_2816. Double a Number Represented as a Linked List.md>) | c | Jul 04, 2024 | diff --git a/markdowns/by_topic/Matrix.md b/markdowns/by_topic/Matrix.md index 47b9a87d..1113865d 100644 --- a/markdowns/by_topic/Matrix.md +++ b/markdowns/by_topic/Matrix.md @@ -7,13 +7,13 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------------------------------------------|:------------|:----------------| | 36 | [Valid Sudoku]() | Medium | N150 | [solution](<../_36. Valid Sudoku.md>) | py | Jun 13, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | +| 48 | [Rotate Image]() | Medium | N150, B75 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | | 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<../_74. Search a 2D Matrix.md>) | py | Jun 14, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | +| 79 | [Word Search]() | Medium | N150, B75 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | +| 200 | [Number of Islands]() | Medium | N150, B75 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | +| 212 | [Word Search II]() | Hard | N150, B75 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | | 286 | [Walls and Gates]() | Medium | N150 | [solution](<../_286. Walls and Gates.md>) | py | Jun 14, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | py, c | Jun 23, 2024 | +| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | c, py | Jun 23, 2024 | | 542 | [01 Matrix]() | Medium | | [solution](<../_542. 01 Matrix.md>) | py | Jun 26, 2024 | | 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 23, 2024 | | 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<../_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | diff --git a/markdowns/by_topic/Memoization.md b/markdowns/by_topic/Memoization.md index 772ccb1a..62d502c9 100644 --- a/markdowns/by_topic/Memoization.md +++ b/markdowns/by_topic/Memoization.md @@ -6,5 +6,5 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |----:|:---------------------------------------------------------------------|:--------|:----------|:-------------------------------------------|:------------|:----------------| -| 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | +| 70 | [Climbing Stairs]() | Easy | N150, B75 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | | 509 | [Fibonacci Number]() | Easy | | [solution](<../_509. Fibonacci Number.md>) | c | Jun 16, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Merge Sort.md b/markdowns/by_topic/Merge Sort.md index 2f4be0f1..8c04e043 100644 --- a/markdowns/by_topic/Merge Sort.md +++ b/markdowns/by_topic/Merge Sort.md @@ -6,4 +6,4 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |----:|:-----------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------|:------------|:----------------| -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | \ No newline at end of file +| 23 | [Merge k Sorted Lists]() | Hard | N150, B75 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Monotonic Queue.md b/markdowns/by_topic/Monotonic Queue.md index 85dc209a..bec3787d 100644 --- a/markdowns/by_topic/Monotonic Queue.md +++ b/markdowns/by_topic/Monotonic Queue.md @@ -8,4 +8,4 @@ |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:------------------------------------------------------------------------------------------------------|:------------|:----------------| | 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | | 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | py, java | Jul 02, 2024 | \ No newline at end of file +| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Monotonic Stack.md b/markdowns/by_topic/Monotonic Stack.md index 0b4d8a3b..4ebd8487 100644 --- a/markdowns/by_topic/Monotonic Stack.md +++ b/markdowns/by_topic/Monotonic Stack.md @@ -8,9 +8,9 @@ |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:--------------------------------------------------------------------------------|:-------------|:----------------| | 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution](<../_84. Largest Rectangle in Histogram.md>) | py | Jun 10, 2024 | | 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | java, c, py | Jun 13, 2024 | +| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | c, java, py | Jun 13, 2024 | | 853 | [Car Fleet]() | Medium | N150 | [solution](<../_853. Car Fleet.md>) | py | Jun 13, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | java, cpp, c | Jun 26, 2024 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, java, cpp | Jun 26, 2024 | | 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<../_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | | 1762 | [Buildings With an Ocean View]() | Medium | | [solution](<../_1762. Buildings With an Ocean View.md>) | py | Jun 10, 2024 | | 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<../_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Prefix Sum.md b/markdowns/by_topic/Prefix Sum.md index c42dfc77..ddc01553 100644 --- a/markdowns/by_topic/Prefix Sum.md +++ b/markdowns/by_topic/Prefix Sum.md @@ -6,13 +6,13 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:--------------------------------------------------------------------------------|:------------|:----------------| -| 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution](<../_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | +| 238 | [Product of Array Except Self]() | Medium | N150, B75 | [solution](<../_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | | 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution](<../_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 | | 848 | [Shifting Letters]() | Medium | | [solution](<../_848. Shifting Letters.md>) | py | Jun 29, 2024 | | 930 | [Binary Subarrays With Sum]() | Medium | | [solution](<../_930. Binary Subarrays With Sum.md>) | py | Jun 21, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | py, java | Jun 09, 2024 | +| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | | 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | | 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution](<../_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>) | py | May 29, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | py, c | Jun 10, 2024 | +| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | | 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | | 3179 | w contest 401 - q2 | Medium | Contest | [solution](<../_3179. w contest 401 - q.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Queue.md b/markdowns/by_topic/Queue.md index af42e26d..67896a65 100644 --- a/markdowns/by_topic/Queue.md +++ b/markdowns/by_topic/Queue.md @@ -12,5 +12,5 @@ | 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution](<../_950. Reveal Cards In Increasing Order.md>) | py | Jun 11, 2024 | | 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | | 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | py, java | Jul 02, 2024 | +| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | | 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution](<../_1700. Number of Students Unable to Eat Lunch.md>) | py | Jun 01, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Quickselect.md b/markdowns/by_topic/Quickselect.md index 8b48c80a..07d405b9 100644 --- a/markdowns/by_topic/Quickselect.md +++ b/markdowns/by_topic/Quickselect.md @@ -6,5 +6,5 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |----:|:-----------------------------------------------------------------------------------------|:--------|:----------|:-----------------------------------------------------|:------------|:----------------| -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Recursion.md b/markdowns/by_topic/Recursion.md index 4d371779..155c3903 100644 --- a/markdowns/by_topic/Recursion.md +++ b/markdowns/by_topic/Recursion.md @@ -7,16 +7,16 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------|:------------|:----------------| | 2 | [Add Two Numbers]() | Medium | N150 | [solution](<../_2. Add Two Numbers.md>) | java | May 22, 2024 | -| 21 | [Merge Two Sorted Lists]() | Easy | B75, N150 | [solution](<../_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | +| 21 | [Merge Two Sorted Lists]() | Easy | N150, B75 | [solution](<../_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | | 24 | [Swap Nodes in Pairs]() | Medium | | [solution](<../_24. Swap Nodes in Pairs.md>) | c | Jun 06, 2024 | | 25 | [Reverse Nodes in k-Group]() | Hard | N150 | [solution](<../_25. Reverse Nodes in k-Group.md>) | c | Jun 06, 2024 | | 50 | [Pow(x, n)]() | Medium | N150 | [solution](<../_50. Pow(x, n).md>) | c, java, py | Jun 22, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | -| 206 | [Reverse Linked List]() | Easy | B75, N150 | [solution](<../_206. Reverse Linked List.md>) | java | Jun 27, 2024 | +| 143 | [Reorder List]() | Medium | N150, B75 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | +| 206 | [Reverse Linked List]() | Easy | N150, B75 | [solution](<../_206. Reverse Linked List.md>) | java | Jun 27, 2024 | | 224 | [Basic Calculator]() | Hard | | [solution](<../_224. Basic Calculator.md>) | py | Jun 10, 2024 | | 273 | [Integer to English Words]() | Hard | | [solution](<../_273. Integer to English Words.md>) | py | Jun 10, 2024 | | 394 | [Decode String]() | Medium | | [solution](<../_394. Decode String.md>) | py | Jun 14, 2024 | | 509 | [Fibonacci Number]() | Easy | | [solution](<../_509. Fibonacci Number.md>) | c | Jun 16, 2024 | | 776 | [Split BST]() | Medium | Weekly Premium | [solution](<../_776. Split BST.md>) | py | Jun 28, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | py, c | Jun 06, 2024 | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | | 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<../_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Simulation.md b/markdowns/by_topic/Simulation.md index 337439f0..3e4e5661 100644 --- a/markdowns/by_topic/Simulation.md +++ b/markdowns/by_topic/Simulation.md @@ -18,7 +18,7 @@ | 1929 | [Concatenation of Array]() | Easy | | [solution](<../_1929. Concatenation of Array.md>) | c, java, py | Jun 03, 2024 | | 2011 | [Final Value of Variable After Performing Operations]() | Easy | | [solution](<../_2011. Final Value of Variable After Performing Operations.md>) | c | Jun 03, 2024 | | 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<../_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 09, 2024 | -| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<../_2181. Merge Nodes in Between Zeros.md>) | c, cpp, java, py | Jul 03, 2024 | +| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<../_2181. Merge Nodes in Between Zeros.md>) | c, java, py, cpp | Jul 03, 2024 | | 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<../_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | | 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<../_2352. Equal Row and Column Pairs.md>) | py | Jun 26, 2024 | | 2365 | [Task Scheduler II]() | Medium | | [solution](<../_2365. Task Scheduler II.md>) | py | Jun 29, 2024 | diff --git a/markdowns/by_topic/Sliding Window.md b/markdowns/by_topic/Sliding Window.md index 7d004ae3..ffa943a1 100644 --- a/markdowns/by_topic/Sliding Window.md +++ b/markdowns/by_topic/Sliding Window.md @@ -6,7 +6,7 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------------------------------|:------------|:----------------| -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | +| 3 | [Longest Substring Without Repeating Characters]() | Medium | N150, B75 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | | 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | | 713 | [Subarray Product Less Than K]() | Medium | | [solution](<../_713. Subarray Product Less Than K.md>) | py | Jul 01, 2024 | | 930 | [Binary Subarrays With Sum]() | Medium | | [solution](<../_930. Binary Subarrays With Sum.md>) | py | Jun 21, 2024 | @@ -15,4 +15,4 @@ | 1248 | [Count Number of Nice Subarrays]() | Medium | Daily | [solution](<../_1248. Count Number of Nice Subarrays.md>) | py | Jun 21, 2024 | | 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | | 1852 | [Distinct Numbers in Each Subarray]() | Medium | | [solution](<../_1852. Distinct Numbers in Each Subarray.md>) | java | Jun 26, 2024 | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | py, java | Jun 21, 2024 | \ No newline at end of file +| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 21, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Sorting.md b/markdowns/by_topic/Sorting.md index bfcf62a2..328563a9 100644 --- a/markdowns/by_topic/Sorting.md +++ b/markdowns/by_topic/Sorting.md @@ -6,13 +6,13 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | -| 56 | [Merge Intervals]() | Medium | B75, N150 | [solution](<../_56. Merge Intervals.md>) | py | Jun 18, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | py, c | Jun 11, 2024 | -| 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | -| 242 | [Valid Anagram]() | Easy | B75, N150 | [solution](<../_242. Valid Anagram.md>) | py, c | Jun 12, 2024 | +| 49 | [Group Anagrams]() | Medium | N150, B75 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | +| 56 | [Merge Intervals]() | Medium | N150, B75 | [solution](<../_56. Merge Intervals.md>) | py | Jun 18, 2024 | +| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | c, py | Jun 11, 2024 | +| 217 | [Contains Duplicate]() | Easy | N150, B75 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | +| 242 | [Valid Anagram]() | Easy | N150, B75 | [solution](<../_242. Valid Anagram.md>) | c, py | Jun 12, 2024 | | 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | +| 347 | [Top K Frequent Elements]() | Medium | N150, B75 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | | 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | | 414 | [Third Maximum Number]() | Easy | | [solution](<../_414. Third Maximum Number.md>) | py | May 23, 2024 | | 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | @@ -34,13 +34,13 @@ | 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<../_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 | | 1051 | [Height Checker]() | Easy | Daily | [solution](<../_1051. Height Checker.md>) | c, py | Jun 09, 2024 | | 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution](<../_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 03, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | py, java | Jun 10, 2024 | +| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | | 1268 | [Search Suggestions System]() | Medium | | [solution](<../_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | | 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | | 1460 | [Make Two Arrays Equal by Reversing Subarrays]() | Easy | | [solution](<../_1460. Make Two Arrays Equal by Reversing Subarrays.md>) | c | Jun 04, 2024 | | 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | | 1502 | [Can Make Arithmetic Progression From Sequence]() | Easy | | [solution](<../_1502. Can Make Arithmetic Progression From Sequence.md>) | c, py | Jun 04, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | py, cpp, c, java | Jul 02, 2024 | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, java, py, cpp | Jul 02, 2024 | | 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution](<../_1552. Magnetic Force Between Two Balls.md>) | py | Jun 20, 2024 | | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | | 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution](<../_1564. Put Boxes Into the Warehouse I.md>) | py | Jun 14, 2024 | @@ -49,12 +49,12 @@ | 1874 | [Minimize Product Sum of Two Arrays]() | Medium | | [solution](<../_1874. Minimize Product Sum of Two Arrays.md>) | c, java | Jun 22, 2024 | | 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<../_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | | 1885 | [Count Pairs in Two Arrays]() | Medium | Weekly Premium | [solution](<../_1885. Count Pairs in Two Arrays.md>) | py | May 21, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | py, c | Jun 03, 2024 | +| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | | 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution](<../_2046. Sort Linked List Already Sorted Using Absolute Values.md>) | py | Jul 04, 2024 | | 2165 | [Smallest Value of the Rearranged Number]() | Medium | | [solution](<../_2165. Smallest Value of the Rearranged Number.md>) | py | Jun 30, 2024 | | 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<../_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | | 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<../_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | py, cpp, c, java | Jun 27, 2024 | +| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | c, java, py, cpp | Jun 27, 2024 | | 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | | 2545 | [Sort the Students by Their Kth Score]() | Medium | | [solution](<../_2545. Sort the Students by Their Kth Score.md>) | java, py | Jun 24, 2024 | | 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | diff --git a/markdowns/by_topic/Stack.md b/markdowns/by_topic/Stack.md index 15c029de..3c98f50f 100644 --- a/markdowns/by_topic/Stack.md +++ b/markdowns/by_topic/Stack.md @@ -6,12 +6,12 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------|:-------------|:----------------| -| 20 | [Valid Parentheses]() | Easy | B75, N150 | [solution](<../_20. Valid Parentheses.md>) | java | May 22, 2024 | +| 20 | [Valid Parentheses]() | Easy | N150, B75 | [solution](<../_20. Valid Parentheses.md>) | java | May 22, 2024 | | 71 | [Simplify Path]() | Medium | | [solution](<../_71. Simplify Path.md>) | py | Jun 10, 2024 | | 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution](<../_84. Largest Rectangle in Histogram.md>) | py | Jun 10, 2024 | | 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<../_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | py, c | Jun 10, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | +| 143 | [Reorder List]() | Medium | N150, B75 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | | 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution](<../_150. Evaluate Reverse Polish Notation.md>) | py | Jun 10, 2024 | | 155 | [Min Stack]() | Medium | N150 | [solution](<../_155. Min Stack.md>) | py | Jun 13, 2024 | | 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | @@ -23,17 +23,17 @@ | 394 | [Decode String]() | Medium | | [solution](<../_394. Decode String.md>) | py | Jun 14, 2024 | | 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | | 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | java, c, py | Jun 13, 2024 | +| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | c, java, py | Jun 13, 2024 | | 853 | [Car Fleet]() | Medium | N150 | [solution](<../_853. Car Fleet.md>) | py | Jun 13, 2024 | | 856 | [Score of Parentheses]() | Medium | | [solution](<../_856. Score of Parentheses.md>) | py | Jun 17, 2024 | | 921 | [Minimum Add to Make Parentheses Valid]() | Medium | | [solution](<../_921. Minimum Add to Make Parentheses Valid.md>) | java, py | Jun 11, 2024 | | 946 | [Validate Stack Sequences]() | Medium | | [solution](<../_946. Validate Stack Sequences.md>) | c, py | Jun 11, 2024 | | 1006 | [Clumsy Factorial]() | Medium | | [solution](<../_1006. Clumsy Factorial.md>) | c, py | Jun 11, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | java, cpp, c | Jun 26, 2024 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, java, cpp | Jun 26, 2024 | | 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<../_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | | 1209 | [Remove All Adjacent Duplicates in String II]() | Medium | | [solution](<../_1209. Remove All Adjacent Duplicates in String II.md>) | py | Jun 17, 2024 | | 1249 | [Minimum Remove to Make Valid Parentheses]() | Medium | | [solution](<../_1249. Minimum Remove to Make Valid Parentheses.md>) | py | Jun 10, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | py, c | Jun 06, 2024 | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | | 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution](<../_1700. Number of Students Unable to Eat Lunch.md>) | py | Jun 01, 2024 | | 1762 | [Buildings With an Ocean View]() | Medium | | [solution](<../_1762. Buildings With an Ocean View.md>) | py | Jun 10, 2024 | | 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 20, 2024 | diff --git a/markdowns/by_topic/String Matching.md b/markdowns/by_topic/String Matching.md index 6937def5..a031ec95 100644 --- a/markdowns/by_topic/String Matching.md +++ b/markdowns/by_topic/String Matching.md @@ -7,7 +7,7 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------------|:------------|:----------------| | 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<../_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | +| 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | | 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | | 758 | [Bold Words in String]() | Medium | | [solution](<../_758. Bold Words in String.md>) | py | Jun 27, 2024 | | 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution](<../_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 | diff --git a/markdowns/by_topic/String.md b/markdowns/by_topic/String.md index c4ba6ac2..543a0cb1 100644 --- a/markdowns/by_topic/String.md +++ b/markdowns/by_topic/String.md @@ -1,4 +1,4 @@ -# [String]() (83 completed) +# [String]() (85 completed) *[Back to top](<../../README.md>)* @@ -6,25 +6,26 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------|:------------|:----------------| -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | +| 3 | [Longest Substring Without Repeating Characters]() | Medium | N150, B75 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | +| 5 | [Longest Palindromic Substring]() | Medium | N150, B75 | [solution](<../_5. Longest Palindromic Substring.md>) | py | Jul 04, 2024 | | 8 | [String to Integer (atoi)]() | Medium | | [solution](<../_8. String to Integer (atoi).md>) | py | Jun 10, 2024 | | 14 | [Longest Common Prefix]() | Easy | | [solution](<../_14. Longest Common Prefix.md>) | java | May 22, 2024 | -| 20 | [Valid Parentheses]() | Easy | B75, N150 | [solution](<../_20. Valid Parentheses.md>) | java | May 22, 2024 | +| 20 | [Valid Parentheses]() | Easy | N150, B75 | [solution](<../_20. Valid Parentheses.md>) | java | May 22, 2024 | | 22 | [Generate Parentheses]() | Medium | N150 | [solution](<../_22. Generate Parentheses.md>) | py | Jun 13, 2024 | | 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<../_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | +| 49 | [Group Anagrams]() | Medium | N150, B75 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | | 71 | [Simplify Path]() | Medium | | [solution](<../_71. Simplify Path.md>) | py | Jun 10, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | -| 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution](<../_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | -| 165 | [Compare Version Numbers]() | Medium | | [solution](<../_165. Compare Version Numbers.md>) | py, c | Jul 02, 2024 | +| 79 | [Word Search]() | Medium | N150, B75 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | +| 125 | [Valid Palindrome]() | Easy | N150, B75 | [solution](<../_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | +| 165 | [Compare Version Numbers]() | Medium | | [solution](<../_165. Compare Version Numbers.md>) | c, py | Jul 02, 2024 | | 166 | [Fraction to Recurring Decimal]() | Medium | | [solution](<../_166. Fraction to Recurring Decimal.md>) | py | May 31, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | +| 208 | [Implement Trie (Prefix Tree)]() | Medium | N150, B75 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | +| 211 | [Design Add and Search Words Data Structure]() | Medium | N150, B75 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | +| 212 | [Word Search II]() | Hard | N150, B75 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | | 224 | [Basic Calculator]() | Hard | | [solution](<../_224. Basic Calculator.md>) | py | Jun 10, 2024 | | 227 | [Basic Calculator II]() | Medium | | [solution](<../_227. Basic Calculator II.md>) | py | Jun 10, 2024 | -| 242 | [Valid Anagram]() | Easy | B75, N150 | [solution](<../_242. Valid Anagram.md>) | py, c | Jun 12, 2024 | -| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | +| 242 | [Valid Anagram]() | Easy | N150, B75 | [solution](<../_242. Valid Anagram.md>) | c, py | Jun 12, 2024 | +| 271 | [Encode and Decode Strings]() | Medium | N150, B75 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | | 273 | [Integer to English Words]() | Hard | | [solution](<../_273. Integer to English Words.md>) | py | Jun 10, 2024 | | 344 | [Reverse String]() | Easy | Daily | [solution](<../_344. Reverse String.md>) | java, py | Jun 01, 2024 | | 345 | [Reverse Vowels of a String]() | Easy | | [solution](<../_345. Reverse Vowels of a String.md>) | py | May 23, 2024 | @@ -36,7 +37,8 @@ | 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | | 535 | [Encode and Decode TinyURL]() | Medium | | [solution](<../_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 | | 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | py, java | Jun 06, 2024 | +| 647 | [Palindromic Substrings]() | Medium | N150, B75 | [solution](<../_647. Palindromic Substrings.md>) | py | Jul 04, 2024 | +| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | java, py | Jun 06, 2024 | | 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | | 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | | 720 | [Longest Word in Dictionary]() | Medium | | [solution](<../_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | @@ -70,17 +72,17 @@ | 1768 | [Merge Strings Alternately]() | Easy | | [solution](<../_1768. Merge Strings Alternately.md>) | java | Jul 01, 2024 | | 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<../_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | | 1844 | [Replace All Digits with Characters]() | Easy | | [solution](<../_1844. Replace All Digits with Characters.md>) | py | Jun 29, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | py, c | Jun 26, 2024 | +| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | | 2011 | [Final Value of Variable After Performing Operations]() | Easy | | [solution](<../_2011. Final Value of Variable After Performing Operations.md>) | c | Jun 03, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | py, c | Jun 10, 2024 | +| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | | 2086 | [Minimum Number of Food Buckets to Feed the Hamsters]() | Medium | | [solution](<../_2086. Minimum Number of Food Buckets to Feed the Hamsters.md>) | java | Jul 01, 2024 | | 2390 | [Removing Stars From a String]() | Medium | | [solution](<../_2390. Removing Stars From a String.md>) | java, py | Jun 01, 2024 | | 2405 | [Optimal Partition of String]() | Medium | | [solution](<../_2405. Optimal Partition of String.md>) | py | Jun 23, 2024 | | 2423 | [Remove Letter To Equalize Frequency]() | Easy | | [solution](<../_2423. Remove Letter To Equalize Frequency.md>) | py | Jun 16, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | py, c, java | Jun 03, 2024 | +| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | | 2678 | [Number of Senior Citizens]() | Easy | | [solution](<../_2678. Number of Senior Citizens.md>) | java | May 22, 2024 | | 2734 | [Lexicographically Smallest String After Substring Operation]() | Medium | | [solution](<../_2734. Lexicographically Smallest String After Substring Operation.md>) | py | Jun 29, 2024 | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | py, java | Jun 21, 2024 | +| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 21, 2024 | | 2942 | [Find Words Containing Character]() | Easy | | [solution](<../_2942. Find Words Containing Character.md>) | c | Jun 03, 2024 | | 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<../_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | | 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | diff --git a/markdowns/by_topic/Topological Sort.md b/markdowns/by_topic/Topological Sort.md index 07e8afd0..6ed50423 100644 --- a/markdowns/by_topic/Topological Sort.md +++ b/markdowns/by_topic/Topological Sort.md @@ -6,4 +6,4 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:-------------------------------------------------------------------------------|:------------|:----------------| -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | py, java | Jun 28, 2024 | \ No newline at end of file +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Tree.md b/markdowns/by_topic/Tree.md index 3b1dab3c..0a1c805f 100644 --- a/markdowns/by_topic/Tree.md +++ b/markdowns/by_topic/Tree.md @@ -7,24 +7,24 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------|:-------------|:----------------| | 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<../_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | +| 98 | [Validate Binary Search Tree]() | Medium | N150, B75 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | +| 100 | [Same Tree]() | Easy | N150, B75 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | +| 102 | [Binary Tree Level Order Traversal]() | Medium | N150, B75 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | | 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution](<../_103. Binary Tree Zigzag Level Order Traversal.md>) | py | Jul 03, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | +| 104 | [Maximum Depth of Binary Tree]() | Easy | N150, B75 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | | 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution](<../_107. Binary Tree Level Order Traversal II.md>) | java | Jul 03, 2024 | | 110 | [Balanced Binary Tree]() | Easy | N150 | [solution](<../_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 | | 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<../_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | | 112 | [Path Sum]() | Easy | | [solution](<../_112. Path Sum.md>) | py | Jul 03, 2024 | | 113 | [Path Sum II]() | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | py, c | Jun 10, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | +| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | +| 124 | [Binary Tree Maximum Path Sum]() | Hard | N150, B75 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | | 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution](<../_129. Sum Root to Leaf Numbers.md>) | py | Jun 07, 2024 | | 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | | 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<../_199. Binary Tree Right Side View.md>) | java, cpp | Jul 04, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | +| 226 | [Invert Binary Tree]() | Easy | N150, B75 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | +| 230 | [Kth Smallest Element in a BST]() | Medium | N150, B75 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | +| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | N150, B75 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | | 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | | 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | | 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | @@ -35,8 +35,8 @@ | 437 | [Path Sum III]() | Medium | | [solution](<../_437. Path Sum III.md>) | py | Jul 03, 2024 | | 450 | [Delete Node in a BST]() | Medium | | [solution](<../_450. Delete Node in a BST.md>) | py | Jun 28, 2024 | | 513 | [Find Bottom Left Tree Value]() | Medium | | [solution](<../_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | java, c, py | Jun 03, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | +| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | c, java, py | Jun 03, 2024 | +| 572 | [Subtree of Another Tree]() | Easy | N150, B75 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | | 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<../_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | | 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | | 663 | [Equal Tree Partition]() | Medium | Daily | [solution](<../_663. Equal Tree Partition.md>) | py | Jun 16, 2024 | @@ -47,7 +47,7 @@ | 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<../_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | | 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | | 993 | [Cousins in Binary Tree]() | Easy | | [solution](<../_993. Cousins in Binary Tree.md>) | py | Jul 03, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | java, cpp, c | Jun 26, 2024 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, java, cpp | Jun 26, 2024 | | 1026 | [Maximum Difference Between Node and Ancestor]() | Medium | | [solution](<../_1026. Maximum Difference Between Node and Ancestor.md>) | py | Jun 23, 2024 | | 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution](<../_1028. Recover a Tree From Preorder Traversal.md>) | py | Jun 30, 2024 | | 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | diff --git a/markdowns/by_topic/Trie.md b/markdowns/by_topic/Trie.md index 010a6ecf..f4112e14 100644 --- a/markdowns/by_topic/Trie.md +++ b/markdowns/by_topic/Trie.md @@ -7,11 +7,11 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-----------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:------------------------------------------------------------------------|:------------|:----------------| | 14 | [Longest Common Prefix]() | Easy | | [solution](<../_14. Longest Common Prefix.md>) | java | May 22, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | +| 208 | [Implement Trie (Prefix Tree)]() | Medium | N150, B75 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | +| 211 | [Design Add and Search Words Data Structure]() | Medium | N150, B75 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | +| 212 | [Word Search II]() | Hard | N150, B75 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | | 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | py, java | Jun 06, 2024 | +| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | java, py | Jun 06, 2024 | | 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | | 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | | 720 | [Longest Word in Dictionary]() | Medium | | [solution](<../_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | diff --git a/markdowns/by_topic/Two Pointers.md b/markdowns/by_topic/Two Pointers.md index bb6580c2..eb27ddaa 100644 --- a/markdowns/by_topic/Two Pointers.md +++ b/markdowns/by_topic/Two Pointers.md @@ -1,4 +1,4 @@ -# [Two Pointers]() (41 completed) +# [Two Pointers]() (43 completed) *[Back to top](<../../README.md>)* @@ -6,18 +6,19 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------|:---------------------------------|:----------------| -| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution](<../_19. Remove Nth Node From End of List.md>) | py, c, java | Jun 06, 2024 | +| 5 | [Longest Palindromic Substring]() | Medium | N150, B75 | [solution](<../_5. Longest Palindromic Substring.md>) | py | Jul 04, 2024 | +| 19 | [Remove Nth Node From End of List]() | Medium | N150, B75 | [solution](<../_19. Remove Nth Node From End of List.md>) | c, java, py | Jun 06, 2024 | | 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution](<../_26. Remove Duplicates from Sorted Array.md>) | java | May 22, 2024 | | 27 | [Remove Element]() | Easy | | [solution](<../_27. Remove Element.md>) | java, py | Jun 02, 2024 | | 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<../_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | | 61 | [Rotate List]() | Medium | | [solution](<../_61. Rotate List.md>) | py | Jun 21, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | py, c | Jun 11, 2024 | +| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | c, py | Jun 11, 2024 | | 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution](<../_82. Remove Duplicates from Sorted List II.md>) | py | Jul 04, 2024 | -| 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution](<../_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<../_141. Linked List Cycle.md>) | py, c | Jun 03, 2024 | +| 125 | [Valid Palindrome]() | Easy | N150, B75 | [solution](<../_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | +| 141 | [Linked List Cycle]() | Easy | N150, B75 | [solution](<../_141. Linked List Cycle.md>) | c, py | Jun 03, 2024 | | 142 | [Linked List Cycle II]() | Medium | | [solution](<../_142. Linked List Cycle II.md>) | py | Jun 25, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | -| 165 | [Compare Version Numbers]() | Medium | | [solution](<../_165. Compare Version Numbers.md>) | py, c | Jul 02, 2024 | +| 143 | [Reorder List]() | Medium | N150, B75 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | +| 165 | [Compare Version Numbers]() | Medium | | [solution](<../_165. Compare Version Numbers.md>) | c, py | Jul 02, 2024 | | 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<../_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 13, 2024 | | 189 | [Rotate Array]() | Medium | | [solution](<../_189. Rotate Array.md>) | py | Jun 02, 2024 | | 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | @@ -30,11 +31,12 @@ | 408 | [Valid Word Abbreviation]() | Easy | | [solution](<../_408. Valid Word Abbreviation.md>) | py | Jun 02, 2024 | | 475 | [Heaters]() | Medium | | [solution](<../_475. Heaters.md>) | py | Jun 07, 2024 | | 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | +| 647 | [Palindromic Substrings]() | Medium | N150, B75 | [solution](<../_647. Palindromic Substrings.md>) | py | Jul 04, 2024 | | 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<../_826. Most Profit Assigning Work.md>) | py | Jun 17, 2024 | | 977 | [Squares of a Sorted Array]() | Easy | | [solution](<../_977. Squares of a Sorted Array.md>) | py | Jun 20, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | py, c | Jun 06, 2024 | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | | 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution](<../_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | py, java, c | Jun 06, 2024 | +| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | | 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<../_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 09, 2024 | | 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution](<../_1721. Swapping Nodes in a Linked List.md>) | c | Jun 06, 2024 | | 1768 | [Merge Strings Alternately]() | Easy | | [solution](<../_1768. Merge Strings Alternately.md>) | java | Jul 01, 2024 | @@ -44,6 +46,6 @@ | 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution](<../_2095. Delete the Middle Node of a Linked List.md>) | c, java | Jun 06, 2024 | | 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 20, 2024 | | 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<../_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 09, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | py, c, java, rb, kt, rs, cpp, js | Jun 09, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | py, c, java | Jun 03, 2024 | +| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | kt, java, cpp, c, rb, py, rs, js | Jun 09, 2024 | +| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | | 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<../_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Union Find.md b/markdowns/by_topic/Union Find.md index 43192773..29ea8d7a 100644 --- a/markdowns/by_topic/Union Find.md +++ b/markdowns/by_topic/Union Find.md @@ -6,8 +6,8 @@ | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:--------------------------------------------------------------------------------------|:------------|:----------------| -| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | +| 128 | [Longest Consecutive Sequence]() | Medium | N150, B75 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | +| 200 | [Number of Islands]() | Medium | N150, B75 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | | 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 23, 2024 | | 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | | 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution](<../_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 03, 2024 | diff --git a/my-submissions/e703 Dual Heap.py b/my-submissions/e703 Dual Heap.py new file mode 100644 index 00000000..8d8f7e6a --- /dev/null +++ b/my-submissions/e703 Dual Heap.py @@ -0,0 +1,31 @@ +class KthLargest: + + def __init__(self, k: int, nums: List[int]): + nums.sort(reverse=True) + self.larger = [x for x in nums[:k]] # min heap + self.smaller = [-x for x in nums[k:]] # max heap + self.k = k + + heapq.heapify(self.smaller) + heapq.heapify(self.larger) + + def add(self, val: int) -> int: + if len(self.larger) < self.k : + heapq.heappush(self.larger, val) + return self.larger[0] + if self.larger and val == self.larger[0] : + return val + + if self.larger and val > self.larger[0] : + transfer = heapq.heappushpop(self.larger, val) + heapq.heappush(self.smaller, -transfer) + return self.larger[0] + + heapq.heappush(self.smaller, -val) + return self.larger[0] + + + +# Your KthLargest object will be instantiated and called as such: +# obj = KthLargest(k, nums) +# param_1 = obj.add(val) \ No newline at end of file diff --git a/my-submissions/e746.py b/my-submissions/e746.py new file mode 100644 index 00000000..36c65dd5 --- /dev/null +++ b/my-submissions/e746.py @@ -0,0 +1,6 @@ +class Solution: + def minCostClimbingStairs(self, cost: List[int]) -> int: + dp = [0] * 2 + [0] * len(cost) + for i, cost in enumerate(cost, 2) : + dp[i] = cost + min(dp[i - 1], dp[i - 2]) + return min(dp[-2:]) \ No newline at end of file diff --git a/my-submissions/m5 v1 inefficient.py b/my-submissions/m5 v1 inefficient.py new file mode 100644 index 00000000..86d35e54 --- /dev/null +++ b/my-submissions/m5 v1 inefficient.py @@ -0,0 +1,18 @@ +class Solution: + def longestPalindrome(self, s: str) -> str: + longest = 0 + longsetS = '' + for i in range(len(s)) : + for j in range(len(s) - 1, i - 1, -1) : + if j - i + 1 <= longest : + continue + isPal = True + for k in range((j - i + 1) // 2) : + if s[i + k] != s[j - k] : + isPal = False + break + if isPal : + longest = j - i + 1 + longsetS = s[i: j+1] + + return longsetS \ No newline at end of file diff --git a/my-submissions/m5 v2 much better.py b/my-submissions/m5 v2 much better.py new file mode 100644 index 00000000..03ebf36b --- /dev/null +++ b/my-submissions/m5 v2 much better.py @@ -0,0 +1,28 @@ +class Solution: + def longestPalindrome(self, s: str) -> str: + longest = 0 + longsetS = '' + for i in range(len(s)) : + currOffset = 1 + while 0 <= i - currOffset and \ + i + currOffset < len(s) and \ + s[i - currOffset] == s[i + currOffset] : + currOffset += 1 + currOffset -= 1 + + if longest < currOffset * 2 + 1 : + longest = currOffset * 2 + 1 + longsetS = s[i - currOffset : i + currOffset + 1] + + for i in range(0, len(s) - 1) : + currOffset = 0 + while 0 <= i - currOffset and \ + i + currOffset + 1 < len(s) and \ + s[i - currOffset] == s[i + currOffset + 1] : + currOffset += 1 + + if longest < currOffset * 2 : + longest = currOffset * 2 + longsetS = s[i - currOffset + 1 : i + currOffset + 1] + + return longsetS \ No newline at end of file diff --git a/my-submissions/m5.md b/my-submissions/m5.md new file mode 100644 index 00000000..1fb01330 --- /dev/null +++ b/my-submissions/m5.md @@ -0,0 +1,13 @@ +***Version 1*** is severly inefficient since it checks each pair of indicies, reasulting in at +least $O(n^2)$ runtime. On top of that, the inside of the nested loop has another for loop +to check whether the substring is a palindrome. This would make the runtime increase further +to a worst case leaning towards $O(n^3)$. While it does avoid redundant cases (i.e.) substrings +of a length that wouldn't improve the current record, it's still a major negative. + +
+ +***Version 2*** on the other hand avoids this by starting from the centre of each potential palindrome. +It iterates through the string twice, once where it assumes the centre is a single character (and thus at +least a palindrome of length $n$) and again where the indices $i$ and $i+1$ are used as the centre. In effect, +it's checking odd and even length palindromes. This ends up being comfortably $O(n^2)$; a much greater improvement +as compared to *Version 1*. \ No newline at end of file diff --git a/my-submissions/m647.py b/my-submissions/m647.py new file mode 100644 index 00000000..43783860 --- /dev/null +++ b/my-submissions/m647.py @@ -0,0 +1,22 @@ +class Solution: + def countSubstrings(self, s: str) -> int: + counter = 0 + + for i in range(len(s)) : + offset = 0 + while 0 <= i - offset \ + and i + offset < len(s) \ + and s[i - offset] == s[i + offset] : + offset += 1 + counter += 1 + + for i in range(len(s) - 1) : + offset = 0 + while 0 <= i - offset \ + and i + offset + 1 < len(s) \ + and s[i - offset] == s[i + offset + 1] : + offset += 1 + counter += 1 + + return counter + \ No newline at end of file