LeetCode 3364 | Minimum Positive Sum Subarray | Java | Easy | Sliding Window | CodeByTushu

LeetCode 3420 | Count Non-Decreasing Subarrays After K Ops | Java | Hard | Deque | CodeByTushu

LeetCode 3105 | Longest Strictly Increasing/Decreasing Subarray | Java | Easy | Array | CodeByTushu

LeetCode 3789 | Minimum Cost to Acquire Required Items | Java | CodeByTushu

LeetCode 3693 | Climbing Stairs II | Java | Medium | Dynamic Programming | CodeByTushu

LeetCode 1606 | Find Servers That Handled Most Requests | Java | Hard | TreeSet | CodeByTushu

LeetCode 1267 | Count Servers that Communicate | Java | Medium | Frequency Array Scan | CodeByTushu

LeetCode 1882 | Process Tasks Using Servers | Java | Medium | Dual Heaps Simulation | CodeByTushu

LeetCode 2747 | Count Zero Request Servers | Java | Medium | Sliding Window & Sorting | CodeByTushu

LeetCode 1582 | Special Positions in a Binary Matrix | Java | Easy | CodeByTushu

LeetCode 1545 | Find Kth Bit in Nth Binary String | Java | Medium | Recursion | CodeByTushu

LeetCode 1536 | Minimum Swaps to Arrange a Binary Grid | Java | Medium | CodeByTushu

LeetCode 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Java | CodeByTushu

LeetCode 1385 | Find the Distance Value Between Two Arrays | Java | Easy | Array | CodeByTushu

LeetCode 3714 | Longest Balanced Substring II | Java | Medium | Prefix Sum | CodeByTushu

LeetCode 3713 | Longest Balanced Substring I | Java | Medium | CodeByTushu

LeetCode 3721 | Longest Balanced Subarray II | Java | Hard | Segment Tree | CodeByTushu

LeetCode 3719 | Longest Balanced Subarray I | Java | Medium | Parity & D C | CodeByTushu

LeetCode 3637 | Trionic Array I | Java | Easy | Three-Phase Linear Scan | CodeByTushu

LeetCode 3013 | Divide an Array Into Subarrays With Minimum Cost II | Java | Hard | CodeByTushu

LeetCode 3505 | Minimum Operations to Make Elements Within K Subarrays Equal | Java | CodeByTushu

LeetCode 3736 | Minimum Moves to Equal Array Elements III | Java | Easy | Greedy | CodeByTushu

LeetCode 462 | Minimum Moves to Equal Array Elements II | Java | Medium | Math | CodeByTushu

LeetCode 453 | Minimum Moves to Equal Array Elements | Java | Medium | Math & Greedy | CodeByTushu

LeetCode 1848 | Minimum Distance to the Target Element | Java | Easy | Array | CodeByTushu

LeetCode 1320 | Minimum Distance to Type a Word Using Two Fingers | Java | Hard | D P | CodeByTushu

LeetCode 3741 | Minimum Distance Between Three Equal Elements II | Java | Medium | CodeByTushu

LeetCode 3740 | Minimum Distance Between Three Equal Elements I | Java | Easy | CodeByTushu

LeetCode 3655 | XOR After Range Multiplication Queries II | Java | Hard | CodeByTushu

LeetCode 3653 | XOR After Range Multiplication Queries I | Java | Medium | Array | CodeByTushu

LeetCode 2069 | Walking Robot Simulation II | Java | Medium | Design & Simulation | CodeByTushu

LeetCode 874 | Walking Robot Simulation | Java | Medium | Array & Simulation | CodeByTushu

LeetCode 657 | Robot Return to Origin | Java | Easy | String & Simulation | CodeByTushu

LeetCode 2075 | Decode the Slanted Ciphertext | Java | Medium | Matrix Simulation | CodeByTushu

LeetCode 3661 | Maximum Walls Destroyed by Robots | Java | Hard | D P & Binary Search | CodeByTushu

LeetCode 3418 | Maximum Amount of Money Robot Can Earn | Java | Medium | 3D D P Grid | CodeByTushu

LeetCode 2751 | Robot Collisions | Java | Hard | Stack & Sorting Simulation | CodeByTushu

LeetCode 3665 | Twisted Mirror Path Count | Java | Medium | Directional Push DP | CodeByTushu

LeetCode 1161 | Maximum Level Sum of a Binary Tree | Java | Medium | B F S | CodeByTushu

LeetCode 3474 | Lexicographically Smallest Generated String | Java | Hard | Greedy | CodeByTushu

LeetCode 2840 | Check if Strings Can be Made Equal With Operations II | Java | Medium | CodeByTushu

LeetCode 2839 | Check if Strings Can be Made Equal With Operations I | Java | Easy | CodeByTushu

LeetCode 2573 | Find the String with LCP | Java | Hard | Greedy & Dynamic Programming | CodeByTushu

LeetCode 2946 | Matrix Similarity After Cyclic Shifts | Java | Easy | Simulation | CodeByTushu

LeetCode 3548 | Equal Sum Grid Partition II | Java | Hard | Matrix Partitioning | CodeByTushu

LeetCode 3546 | Equal Sum Grid Partition I | Java | Medium | Matrix Partitioning | CodeByTushu

LeetCode 2906 | Construct Product Matrix | Java | Medium | Prefix & Suffix Products | CodeByTushu

LeetCode 1594 | Maximum Non Negative Product in a Matrix | Java | Medium | 2D D P | CodeByTushu

LeetCode 1886 | Determine Whether Matrix Can Be Obtained By Rotation | Java | Easy | CodeByTushu

LeetCode 3643 | Flip Square Submatrix Vertically | Java | Easy | Two Pointers | CodeByTushu