Канал: codingMohan

3297. Count Substrings That Can Be Rearranged to Contain a String I | Weekly Leetcode 416

3297. Count Substrings That Can Be Rearranged to Contain a String I | Weekly Leetcode 416

3298. Count Substrings That Can Be Rearranged to Contain a String II | Weekly Leetcode 416

3298. Count Substrings That Can Be Rearranged to Contain a String II | Weekly Leetcode 416

3287. Find the Maximum Sequence Value of Array | Leetcode Biweekly 139

3287. Find the Maximum Sequence Value of Array | Leetcode Biweekly 139

3291. Minimum Number of Valid Strings to Form Target I | Weekly Leetcode 415

3291. Minimum Number of Valid Strings to Form Target I | Weekly Leetcode 415

3292. Minimum Number of Valid Strings to Form Target II | Weekly Leetcode 415 | Z-Algorithm

3292. Minimum Number of Valid Strings to Form Target II | Weekly Leetcode 415 | Z-Algorithm

3283. Maximum Number of Moves to Kill All Pawns | Weekly Leetcode 414

3283. Maximum Number of Moves to Kill All Pawns | Weekly Leetcode 414

3277. Maximum XOR Score Subarray Queries | Weekly Leetcode 413

3277. Maximum XOR Score Subarray Queries | Weekly Leetcode 413

3276. Select Cells in Grid With Maximum Score | Weekly Leetcode 413

3276. Select Cells in Grid With Maximum Score | Weekly Leetcode 413

3267. Count Almost Equal Pairs II | Weekly Leetcode 412

3267. Count Almost Equal Pairs II | Weekly Leetcode 412

3266. Final Array State After K Multiplication Operations II | Weekly Leetcode 412

3266. Final Array State After K Multiplication Operations II | Weekly Leetcode 412

3250. Find the Count of Monotonic Pairs I | Weekly Leetcode 410

3250. Find the Count of Monotonic Pairs I | Weekly Leetcode 410

3251. Find the Count of Monotonic Pairs II | Weekly Leetcode 410

3251. Find the Count of Monotonic Pairs II | Weekly Leetcode 410

3245. Alternating Groups III | Weekly Leetcode 409

3245. Alternating Groups III | Weekly Leetcode 409

3244. Shortest Distance After Road Addition Queries II | Weekly Leetcode 409

3244. Shortest Distance After Road Addition Queries II | Weekly Leetcode 409

3235. Check if the Rectangle Corner Is Reachable | Weekly Leetcode 408

3235. Check if the Rectangle Corner Is Reachable | Weekly Leetcode 408

3234. Count the Number of Substrings With Dominant Ones | Weekly Leetcode 408

3234. Count the Number of Substrings With Dominant Ones | Weekly Leetcode 408

3225. Maximum Score From Grid Operations | Leetcode Biweekly 135

3225. Maximum Score From Grid Operations | Leetcode Biweekly 135

3229. Minimum Operations to Make Array Equal to Target | Weekly Leetcode 407

3229. Minimum Operations to Make Array Equal to Target | Weekly Leetcode 407

3218. Minimum Cost for Cutting Cake I | Weekly Leetcode 406

3218. Minimum Cost for Cutting Cake I | Weekly Leetcode 406

3219. Minimum Cost for Cutting Cake II | Weekly Leetcode 406

3219. Minimum Cost for Cutting Cake II | Weekly Leetcode 406

3213. Construct String with Minimum Cost | Weekly Leetcode 405

3213. Construct String with Minimum Cost | Weekly Leetcode 405

3209. Number of Subarrays With AND Value of K | Leetcode Biweekly 134

3209. Number of Subarrays With AND Value of K | Leetcode Biweekly 134

3212. Count Submatrices With Equal Frequency of X and Y | Weekly Leetcode 405

3212. Count Submatrices With Equal Frequency of X and Y | Weekly Leetcode 405

3202. Find the Maximum Length of Valid Subsequence II | Weekly Leetcode 404

3202. Find the Maximum Length of Valid Subsequence II | Weekly Leetcode 404

3203. Find Minimum Diameter After Merging Two Trees | Weekly Leetcode 404

3203. Find Minimum Diameter After Merging Two Trees | Weekly Leetcode 404

3197. Find the Minimum Area to Cover All Ones II | Weekly Leetcode 403

3197. Find the Minimum Area to Cover All Ones II | Weekly Leetcode 403

3186. Maximum Total Damage With Spell Casting | Weekly Leetcode 402

3186. Maximum Total Damage With Spell Casting | Weekly Leetcode 402

3187. Peaks in Array | Weekly Leetcode 402

3187. Peaks in Array | Weekly Leetcode 402

3170. Lexicographically Minimum String After Removing Stars | Weekly Leetcode 400

3170. Lexicographically Minimum String After Removing Stars | Weekly Leetcode 400

3171. Find Subarray With Bitwise AND Closest to K | 2 different Approaches | Weekly Leetcode 400

3171. Find Subarray With Bitwise AND Closest to K | 2 different Approaches | Weekly Leetcode 400

3165. Maximum Sum of Subsequence With Non-adjacent Elements | Bonus Qs + Hint | Weekly Leetcode 399

3165. Maximum Sum of Subsequence With Non-adjacent Elements | Bonus Qs + Hint | Weekly Leetcode 399

3164. Find the Number of Good Pairs II | 2 Approaches | Weekly Leetcode 399

3164. Find the Number of Good Pairs II | 2 Approaches | Weekly Leetcode 399

3154. Find Number of Ways to Reach the K-th Stair | Weekly Leetcode 398

3154. Find Number of Ways to Reach the K-th Stair | Weekly Leetcode 398

3145. Find Products of Elements of Big Array | Leetcode Biweekly 130

3145. Find Products of Elements of Big Array | Leetcode Biweekly 130

3149. Find the Minimum Cost Array Permutation | Weekly Leetcode 397

3149. Find the Minimum Cost Array Permutation | Weekly Leetcode 397

3148. Maximum Difference Score in a Grid | Top Down + Bottom Up | Weekly Leetcode 397

3148. Maximum Difference Score in a Grid | Top Down + Bottom Up | Weekly Leetcode 397

3144. Minimum Substring Partition of Equal Character Freqcy | HARDER VERSION | Leetcode Biweekly 130

3144. Minimum Substring Partition of Equal Character Freqcy | HARDER VERSION | Leetcode Biweekly 130

3139. Minimum Cost to Equalize Array | Weekly Leetcode 396

3139. Minimum Cost to Equalize Array | Weekly Leetcode 396

3122. Minimum Number of Operations to Satisfy Conditions [HARDER VERSION] | Weekly Leetcode 394

3122. Minimum Number of Operations to Satisfy Conditions [HARDER VERSION] | Weekly Leetcode 394

3123. Find Edges in Shortest Paths | Weekly Leetcode 394

3123. Find Edges in Shortest Paths | Weekly Leetcode 394

3117. Minimum Sum of Values by Dividing Array | Weekly Leetcode 393

3117. Minimum Sum of Values by Dividing Array | Weekly Leetcode 393

3116. Kth Smallest Amount With Single Denomination Combination | Weekly Leetcode 393

3116. Kth Smallest Amount With Single Denomination Combination | Weekly Leetcode 393

3113. Find the Number of Subarrays Where Boundary Elements Are Maximum | Leetcode Biweekly 128

3113. Find the Number of Subarrays Where Boundary Elements Are Maximum | Leetcode Biweekly 128

3108. Minimum Cost Walk in Weighted Graph | Weekly Leetcode 392

3108. Minimum Cost Walk in Weighted Graph | Weekly Leetcode 392

3102. Minimize Manhattan Distances | Weekly Leetcode 391

3102. Minimize Manhattan Distances | Weekly Leetcode 391

3098. Find the Sum of Subsequence Powers | Leetcode Biweekly 127

3098. Find the Sum of Subsequence Powers | Leetcode Biweekly 127

3097. Shortest Subarray With OR at Least K II | Leetcode Biweekly 127

3097. Shortest Subarray With OR at Least K II | Leetcode Biweekly 127

3093. Longest Common Suffix Queries | Weekly Leetcode 390

3093. Longest Common Suffix Queries | Weekly Leetcode 390

3086. Minimum Moves to Pick K Ones | Weekly Leetcode 389

3086. Minimum Moves to Pick K Ones | Weekly Leetcode 389

3085. Minimum Deletions to Make String K-Special | HARDER VERSION | Weekly Leetcode 389

3085. Minimum Deletions to Make String K-Special | HARDER VERSION | Weekly Leetcode 389

3082. Find the Sum of the Power of All Subsequences | Leetcode Biweekly 126

3082. Find the Sum of the Power of All Subsequences | Leetcode Biweekly 126

3077. Maximum Strength of K Disjoint Subarrays | Weekly Leetcode 388

3077. Maximum Strength of K Disjoint Subarrays | Weekly Leetcode 388

3068. Find the Maximum Sum of Node Values | Leetcode Biweekly 125

3068. Find the Maximum Sum of Node Values | Leetcode Biweekly 125

3072. Distribute Elements Into Two Arrays II | Weekly Leetcode 387

3072. Distribute Elements Into Two Arrays II | Weekly Leetcode 387

3049. Earliest Second to Mark Indices II | Weekly Leetcode 386

3049. Earliest Second to Mark Indices II | Weekly Leetcode 386

3048. Earliest Second to Mark Indices I | Weekly Leetcode 386

3048. Earliest Second to Mark Indices I | Weekly Leetcode 386

3041. Maximize Consecutive Elements in an Array After Modification | Leetcode Biweekly 124

3041. Maximize Consecutive Elements in an Array After Modification | Leetcode Biweekly 124

3045. Count Prefix and Suffix Pairs II | Weekly Leetcode 385

3045. Count Prefix and Suffix Pairs II | Weekly Leetcode 385

3040. Maximum Number of Operations With the Same Score II | Leetcode Biweekly 124

3040. Maximum Number of Operations With the Same Score II | Leetcode Biweekly 124

3036. Number of Subarrays That Match a Pattern II | Leetcode Weekly 384

3036. Number of Subarrays That Match a Pattern II | Leetcode Weekly 384

3035. Maximum Palindromes After Operations | Weekly Leetcode 384

3035. Maximum Palindromes After Operations | Weekly Leetcode 384

3027. Find the Number of Ways to Place People II | Leetcode Biweekly 123

3027. Find the Number of Ways to Place People II | Leetcode Biweekly 123

3031. Minimum Time to Revert Word to Initial State II | Weekly Leetcode 383

3031. Minimum Time to Revert Word to Initial State II | Weekly Leetcode 383

3026. Maximum Good Subarray Sum | Leetcode Biweekly 123

3026. Maximum Good Subarray Sum | Leetcode Biweekly 123

3022. Minimize OR of Remaining Elements Using Operations | Weekly Leetcode 382

3022. Minimize OR of Remaining Elements Using Operations | Weekly Leetcode 382

3021. Alice and Bob Playing Flower Game | Harder Follow-up | Weekly Leetcode 382

3021. Alice and Bob Playing Flower Game | Harder Follow-up | Weekly Leetcode 382

3017. Count the Number of Houses at a Certain Distance II | Weekly Leetcode 381

3017. Count the Number of Houses at a Certain Distance II | Weekly Leetcode 381

3013. Divide an Array Into Subarrays With Minimum Cost II | Leetcode Biweekly 122

3013. Divide an Array Into Subarrays With Minimum Cost II | Leetcode Biweekly 122

3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K | Weekly Leetcode 380

3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K | Weekly Leetcode 380

3008. Find Beautiful Indices in the Given Array II | Weekly Leetcode 380

3008. Find Beautiful Indices in the Given Array II | Weekly Leetcode 380

10038. Maximize the Number of Partitions After Operations | Weekly Leetcode 379

10038. Maximize the Number of Partitions After Operations | Weekly Leetcode 379

10037. Maximum Size of a Set After Removals | Weekly Leetcode 379

10037. Maximum Size of a Set After Removals | Weekly Leetcode 379

10034. Count the Number of Powerful Integers | Leetcode Biweekly 121

10034. Count the Number of Powerful Integers | Leetcode Biweekly 121

10033. Minimum Number of Operations to Make X and Y Equal | Leetcode Biweekly 121

10033. Minimum Number of Operations to Make X and Y Equal | Leetcode Biweekly 121

2982. Find Longest Special Substring That Occurs Thrice II || 2891 | Weekly Leetcode 378

2982. Find Longest Special Substring That Occurs Thrice II || 2891 | Weekly Leetcode 378

2983. Palindrome Rearrangement Queries | Weekly Leetcode 378

2983. Palindrome Rearrangement Queries | Weekly Leetcode 378

2976. Minimum Cost to Convert String | With Harder follow-up | Weekly Leetcode 377

2976. Minimum Cost to Convert String | With Harder follow-up | Weekly Leetcode 377

2976. Minimum Cost to Convert String | With 2 follow-ups | Weekly Leetcode 377

2976. Minimum Cost to Convert String | With 2 follow-ups | Weekly Leetcode 377

Find Number of Coins to Place in Tree Nodes | Leetcode Biweekly 120

Find Number of Coins to Place in Tree Nodes | Leetcode Biweekly 120

Count the Number of Incremovable Subarrays II | Leetcode Biweekly 120

Count the Number of Incremovable Subarrays II | Leetcode Biweekly 120

2968. Apply Operations to Maximize Frequency Score | Weekly Leetcode 376

2968. Apply Operations to Maximize Frequency Score | Weekly Leetcode 376

2945. Find Maximum Non-decreasing Array Length | Leetcode Biweekly 118

2945. Find Maximum Non-decreasing Array Length | Leetcode Biweekly 118

2949. Count Beautiful Substrings II | Weekly Leetcode 373

2949. Count Beautiful Substrings II | Weekly Leetcode 373

2948. Make Lexicographically Smallest Array by Swapping Elements | Weekly Leetcode 373

2948. Make Lexicographically Smallest Array by Swapping Elements | Weekly Leetcode 373

2940. Find Building Where Alice and Bob Can Meet | Weekly Leetcode 372

2940. Find Building Where Alice and Bob Can Meet | Weekly Leetcode 372

2939. Maximum Xor Product | Weekly Leetcode 372

2939. Maximum Xor Product | Weekly Leetcode 372

2930. Number of Strings Which Can Be Rearranged to Contain Substring | Leetcode Biweekly 117

2930. Number of Strings Which Can Be Rearranged to Contain Substring | Leetcode Biweekly 117

2935. Maximum Strong Pair XOR II | Weekly Leetcode 371

2935. Maximum Strong Pair XOR II | Weekly Leetcode 371

Segment Trees Series | Part 14 | Range Updates | Lazy Propagation

Segment Trees Series | Part 14 | Range Updates | Lazy Propagation

2925. Maximum Score After Applying Operations on a Tree | Weekly Leetcode 370

2925. Maximum Score After Applying Operations on a Tree | Weekly Leetcode 370

2926. Maximum Balanced Subsequence Sum | Weekly Leetcode 370

2926. Maximum Balanced Subsequence Sum | Weekly Leetcode 370

2919. Minimum Increment Operations to Make Array Beautiful | Weekly Leetcode 369

2919. Minimum Increment Operations to Make Array Beautiful | Weekly Leetcode 369

2920. Maximum Points After Collecting Coins From All Nodes | Weekly Leetcode 369

2920. Maximum Points After Collecting Coins From All Nodes | Weekly Leetcode 369

2916. Subarrays Distinct Element Sum of Squares II | 2913 | Leetcode Biweekly 116

2916. Subarrays Distinct Element Sum of Squares II | 2913 | Leetcode Biweekly 116

2911. Minimum Changes to Make K Semi-palindromes | Weekly Leetcode 368

2911. Minimum Changes to Make K Semi-palindromes | Weekly Leetcode 368

2910. Minimum Number of Groups to Create a Valid Assignment | Weekly Leetcode 368

2910. Minimum Number of Groups to Create a Valid Assignment | Weekly Leetcode 368

2902. Count of Sub-Multisets With Bounded Sum | Leetcode Biweekly 115

2902. Count of Sub-Multisets With Bounded Sum | Leetcode Biweekly 115

2901. Longest Unequal Adjacent Groups Subsequence II | 2900 | Leetcode Biweekly 115

2901. Longest Unequal Adjacent Groups Subsequence II | 2900 | Leetcode Biweekly 115

2896. Apply Operations to Make Two Strings Equal | Weekly Leetcode 366

2896. Apply Operations to Make Two Strings Equal | Weekly Leetcode 366

2897. Apply Operations on Array to Maximize Sum of Squares | Weekly Leetcode 366

2897. Apply Operations on Array to Maximize Sum of Squares | Weekly Leetcode 366

2876. Count Visited Nodes in a Directed Graph | Weekly Leetcode 365

2876. Count Visited Nodes in a Directed Graph | Weekly Leetcode 365

2875. Minimum Size Subarray in Infinite Array | Weekly Leetcode 364

2875. Minimum Size Subarray in Infinite Array | Weekly Leetcode 364

2871. Split Array Into Maximum Number of Subarrays | Leetcode Biweekly 114

2871. Split Array Into Maximum Number of Subarrays | Leetcode Biweekly 114

2872. Maximum Number of K-Divisible Components | Leetcode Biweekly 114

2872. Maximum Number of K-Divisible Components | Leetcode Biweekly 114

2865. Beautiful Towers I | 2866. Beautiful Towers II | Weekly Leetcode 364

2865. Beautiful Towers I | 2866. Beautiful Towers II | Weekly Leetcode 364

Segment Trees Series | Part 13 | Persistent Segment Trees - KQUERY

Segment Trees Series | Part 13 | Persistent Segment Trees - KQUERY

2867. Count Valid Paths in a Tree | Weekly Leetcode 364

2867. Count Valid Paths in a Tree | Weekly Leetcode 364

2858. Minimum Edge Reversals So Every Node Is Reachable | Leetcode Biweekly 113

2858. Minimum Edge Reversals So Every Node Is Reachable | Leetcode Biweekly 113

2861. Maximum Number of Alloys | With small follow-up | Weekly Leetcode 363

2861. Maximum Number of Alloys | With small follow-up | Weekly Leetcode 363

2862. Maximum Element-Sum of a Complete Subset of Indices | Weekly Leetcode 363

2862. Maximum Element-Sum of a Complete Subset of Indices | Weekly Leetcode 363

2857. Count Pairs of Points With Distance k | Leetcode Biweekly 113

2857. Count Pairs of Points With Distance k | Leetcode Biweekly 113

2856. Minimum Array Length After Pair Removals | Leetcode Biweekly 113

2856. Minimum Array Length After Pair Removals | Leetcode Biweekly 113

2851. String Transformation | Weekly Leetcode 362

2851. String Transformation | Weekly Leetcode 362

2850. Minimum Moves to Spread Stones Over Grid | With Harder Follow-up | Weekly Leetcode 362

2850. Minimum Moves to Spread Stones Over Grid | With Harder Follow-up | Weekly Leetcode 362

Segment Trees Series | Part 12 | Persistent Segment Trees - Introduction

Segment Trees Series | Part 12 | Persistent Segment Trees - Introduction

2845. Count of Interesting Subarrays | Weekly Leetcode 361

2845. Count of Interesting Subarrays | Weekly Leetcode 361

2846. Minimum Edge Weight Equilibrium Queries in a Tree | Binary Lifting | Weekly Leetcode 361

2846. Minimum Edge Weight Equilibrium Queries in a Tree | Binary Lifting | Weekly Leetcode 361

2842. Count K-Subsequences of a String With Maximum Beauty | Recursion | Leetcode Biweekly 112

2842. Count K-Subsequences of a String With Maximum Beauty | Recursion | Leetcode Biweekly 112

2841. Maximum Sum of Almost Unique Subarray | Harder Follow-ups | Leetcode Biweekly 112

2841. Maximum Sum of Almost Unique Subarray | Harder Follow-ups | Leetcode Biweekly 112

2836. Maximize Value of Function in a Ball Passing Game | Binary Lifting | Weekly Leetcode 360

2836. Maximize Value of Function in a Ball Passing Game | Binary Lifting | Weekly Leetcode 360

2835. Minimum Operations to Form Subsequence With Target Sum | Weekly Leetcode 360

2835. Minimum Operations to Form Subsequence With Target Sum | Weekly Leetcode 360

2835. Minimum Operations to Form Subsequence With Target Sum | Weekly Leetcode 360

2835. Minimum Operations to Form Subsequence With Target Sum | Weekly Leetcode 360

2830. Maximize the Profit as the Salesman | Weekly Leetcode 359

2830. Maximize the Profit as the Salesman | Weekly Leetcode 359

2826. Sorting Three Groups | Harder Follow-ups | Leetcode Biweekly 111

2826. Sorting Three Groups | Harder Follow-ups | Leetcode Biweekly 111

2831. Find the Longest Equal Subarray | 2 Pointers + Binary Search | Weekly Leetcode 359

2831. Find the Longest Equal Subarray | 2 Pointers + Binary Search | Weekly Leetcode 359

2827. Number of Beautiful Integers in the Range | Digit DP| Leetcode Biweekly 111

2827. Number of Beautiful Integers in the Range | Digit DP| Leetcode Biweekly 111

2818. Apply Operations to Maximize Score | Weekly Leetcode 358

2818. Apply Operations to Maximize Score | Weekly Leetcode 358

2809. Minimum Time to Make Array Sum At Most x | All Proofs | Exchange Args | Leetcode Biweekly 110

2809. Minimum Time to Make Array Sum At Most x | All Proofs | Exchange Args | Leetcode Biweekly 110

2812. Find the Safest Path in a Grid | With a harder follow-up | Weekly Leetcode 357

2812. Find the Safest Path in a Grid | With a harder follow-up | Weekly Leetcode 357

2808. Minimum Seconds to Equalize a Circular Array | O(N^3) - O(N*N) - O(N) | Leetcode Biweekly 110

2808. Minimum Seconds to Equalize a Circular Array | O(N^3) - O(N*N) - O(N) | Leetcode Biweekly 110

2800. Shortest String That Contains Three Strings | Leetcode Weekly 356

2800. Shortest String That Contains Three Strings | Leetcode Weekly 356

2801. Count Stepping Numbers in Range | Digit DP Explained (again :D)

2801. Count Stepping Numbers in Range | Digit DP Explained (again :D)

Segment Trees Series | Part 11 | Merge Sort Tree - MKTHNUM (K-th Number)

Segment Trees Series | Part 11 | Merge Sort Tree - MKTHNUM (K-th Number)

2791. Count Paths That Can Form a Palindrome in a Tree | O(N^3) - O(N*N) - O(N) |Leetcode Weekly 355

2791. Count Paths That Can Form a Palindrome in a Tree | O(N^3) - O(N*N) - O(N) |Leetcode Weekly 355

2787. Ways to Express an Integer as Sum of Powers | Leetcode Biweekly 109

2787. Ways to Express an Integer as Sum of Powers | Leetcode Biweekly 109

2786. Visit Array Positions to Maximize Score | O(1) Space complexity | Leetcode Biweekly 109

2786. Visit Array Positions to Maximize Score | O(1) Space complexity | Leetcode Biweekly 109

Segment Trees Series | Part 10 | Merge Sort Tree - Solving problems - KQUERY, GIVEAWAY

Segment Trees Series | Part 10 | Merge Sort Tree - Solving problems - KQUERY, GIVEAWAY

Harder Follow-ups | 2781. Length of the Longest Valid Substring | Leetcode Weekly 354

Harder Follow-ups | 2781. Length of the Longest Valid Substring | Leetcode Weekly 354

Harder Follow-ups | 2771. Longest Non-decreasing Subarray From Two Arrays | Leetcode Weekly 353

Harder Follow-ups | 2771. Longest Non-decreasing Subarray From Two Arrays | Leetcode Weekly 353

O(NlogK), O(N) | 2772. Apply Operations to Make All Array Elements Equal to 0 | Leetcode Weekly 353

O(NlogK), O(N) | 2772. Apply Operations to Make All Array Elements Equal to 0 | Leetcode Weekly 353

2 Approaches | 2768. Number of Black Blocks | Biweekly Contest 108

2 Approaches | 2768. Number of Black Blocks | Biweekly Contest 108

2 Approaches | 2763. Sum of Imbalance Numbers of All Subarrays | Leetcode Weekly Contest 352

2 Approaches | 2763. Sum of Imbalance Numbers of All Subarrays | Leetcode Weekly Contest 352

3 different Approaches | 2762. Continuous Subarrays | Leetcode Weekly Contest 352

3 different Approaches | 2762. Continuous Subarrays | Leetcode Weekly Contest 352

Segment Trees Series | Part 9 | Merge Sort Tree (Why, What and How)

Segment Trees Series | Part 9 | Merge Sort Tree (Why, What and How)

Bottom Up DP | 2750. Ways to Split Array Into Good Subarrays | Leetcode Weekly Contest 351

Bottom Up DP | 2750. Ways to Split Array Into Good Subarrays | Leetcode Weekly Contest 351

2749. Minimum Operations to Make the Integer Zero | Leetcode Weekly Contest 351

2749. Minimum Operations to Make the Integer Zero | Leetcode Weekly Contest 351

2751. Robot Collisions | Leetcode Weekly Contest 351

2751. Robot Collisions | Leetcode Weekly Contest 351

Bitmask DP | 2741. Special Permutations | Leetcode Weekly Contest 350

Bitmask DP | 2741. Special Permutations | Leetcode Weekly Contest 350

Segment Trees Series | Part 8 | Binary Search | 2653. Sliding Subarray Beauty

Segment Trees Series | Part 8 | Binary Search | 2653. Sliding Subarray Beauty

6473. Maximum Sum Queries | Merge Sort Trees | Segment Tree | Leetcode Weekly Contest 349

6473. Maximum Sum Queries | Merge Sort Trees | Segment Tree | Leetcode Weekly Contest 349

2735. Collecting Chocolates | Leetcode Weekly Contest 349

2735. Collecting Chocolates | Leetcode Weekly Contest 349

2732. Find a Good Subset of the Matrix | Biweekly Contest 106

2732. Find a Good Subset of the Matrix | Biweekly Contest 106

2731. Movement of Robots | Biweekly Contest 106

2731. Movement of Robots | Biweekly Contest 106

2718. Sum of Matrix After Queries | Binary Search | Leetcode Weekly Contest 348

2718. Sum of Matrix After Queries | Binary Search | Leetcode Weekly Contest 348

Digit DP | 2719. Count of Integers | Leetcode Weekly Contest 348

Digit DP | 2719. Count of Integers | Leetcode Weekly Contest 348

Segment Trees Series | Part 7 | Binary Search using Segment Trees

Segment Trees Series | Part 7 | Binary Search using Segment Trees

2713. Maximum Strictly Increasing Cells in a Matrix | Leetcode Weekly Contest 347

2713. Maximum Strictly Increasing Cells in a Matrix | Leetcode Weekly Contest 347

2709. Greatest Common Divisor Traversal | Biweekly Contest 105

2709. Greatest Common Divisor Traversal | Biweekly Contest 105

Modify Graph Edge Weights | Weekly Contest 346

Modify Graph Edge Weights | Weekly Contest 346

Find the Punishment Number of an Integer | Weekly Contest 346

Find the Punishment Number of an Integer | Weekly Contest 346

Segment Trees Series | Part 6 | Solving Spoj problem "HMLIS - HowManyLis"

Segment Trees Series | Part 6 | Solving Spoj problem "HMLIS - HowManyLis"

Maximum OR | Biweekly Contest 104

Maximum OR | Biweekly Contest 104

Power of Heroes | Biweekly Contest 104

Power of Heroes | Biweekly Contest 104

Make Costs of Paths Equal in a Binary Tree | Weekly Contest 344

Make Costs of Paths Equal in a Binary Tree | Weekly Contest 344

Number of Adjacent Elements With the Same Color | HARDER Follow-ups | Weekly Contest 344

Number of Adjacent Elements With the Same Color | HARDER Follow-ups | Weekly Contest 344

Lexicographically Smallest Beautiful String | Weekly Contest 343

Lexicographically Smallest Beautiful String | Weekly Contest 343

Make Array Empty | Biweekly Contest 103

Make Array Empty | Biweekly Contest 103

Segment Trees Series | Part 5 | Longest Increasing Subsequence - LIS

Segment Trees Series | Part 5 | Longest Increasing Subsequence - LIS

Sliding Subarray Beauty | Harder Follow-ups | Weekly Contest 342

Sliding Subarray Beauty | Harder Follow-ups | Weekly Contest 342

Minimum Number of Operations to Make All Array Elements Equal to 1 | Harder Follow-ups | Weekly 342

Minimum Number of Operations to Make All Array Elements Equal to 1 | Harder Follow-ups | Weekly 342

Segment Trees Series | Part 4 | Solving Codeforces problem "Pashmak and Parmida's problem"

Segment Trees Series | Part 4 | Solving Codeforces problem "Pashmak and Parmida's problem"

Minimize the Total Price of the Trips | Harder Follow-up | Weekly Contest 341

Minimize the Total Price of the Trips | Harder Follow-up | Weekly Contest 341

Cousins in Binary Tree II | Some Harder Follow ups | Biweekly Contest 102

Cousins in Binary Tree II | Some Harder Follow ups | Biweekly Contest 102

Design Graph With Shortest Path Calculator | Biweekly Contest 102

Design Graph With Shortest Path Calculator | Biweekly Contest 102

Segment Trees Series | Part 3 | Solving Codeforces problem "Enemy is Weak"

Segment Trees Series | Part 3 | Solving Codeforces problem "Enemy is Weak"

Minimum Number of Visited Cells in a Grid | 2617 | Weekly Contest 340

Minimum Number of Visited Cells in a Grid | 2617 | Weekly Contest 340

Minimize the Maximum Difference of Pairs | 6359 | Weekly Contest 340

Minimize the Maximum Difference of Pairs | 6359 | Weekly Contest 340

Segment Trees Series | Queries on prefix of array | 57E Enemy is Weak

Segment Trees Series | Queries on prefix of array | 57E Enemy is Weak

Minimum Reverse Operations | Weekly Contest 339

Minimum Reverse Operations | Weekly Contest 339

Mice and Cheese | Weekly Contest 339

Mice and Cheese | Weekly Contest 339

Make K-Subarray Sums Equal | Biweekly Contest 101

Make K-Subarray Sums Equal | Biweekly Contest 101

Shortest Cycle in a Graph | Biweekly Contest 101

Shortest Cycle in a Graph | Biweekly Contest 101

Collect Coins in a Tree | In Out DP Explained | Weekly Contest 338

Collect Coins in a Tree | In Out DP Explained | Weekly Contest 338

Segment Trees Series | Basics of Segment Trees

Segment Trees Series | Basics of Segment Trees

Smallest Missing Non-negative Integer After Operations [HARDER Follow-up] | Weekly Contest 337

Smallest Missing Non-negative Integer After Operations [HARDER Follow-up] | Weekly Contest 337

The Number of Beautiful Subsets | Weekly Contest 337

The Number of Beautiful Subsets | Weekly Contest 337

Find Score of an Array After Marking All Elements | Biweekly Contest 100

Find Score of an Array After Marking All Elements | Biweekly Contest 100

Minimum Time to Repair Cars | Biweekly Contest 100

Minimum Time to Repair Cars | Biweekly Contest 100

Minimum Time to Complete All Tasks | Weekly Contest 336

Minimum Time to Complete All Tasks | Weekly Contest 336

Count the Number of Beautiful Subarrays | Weekly Contest 336

Count the Number of Beautiful Subarrays | Weekly Contest 336

Number of Ways to Earn Points | Weekly Contest 335

Number of Ways to Earn Points | Weekly Contest 335

Split the Array to Make Coprime Products | Weekly Contest 335

Split the Array to Make Coprime Products | Weekly Contest 335

Count Number of Possible Root Nodes | Biweekly Contest 99

Count Number of Possible Root Nodes | Biweekly Contest 99

Minimum Time to Visit a Cell In a Grid | Weekly Contest 334

Minimum Time to Visit a Cell In a Grid | Weekly Contest 334

Find the Maximum Number of Marked Indices | How to reach 2 pointers solution? | Weekly Contest 334

Find the Maximum Number of Marked Indices | How to reach 2 pointers solution? | Weekly Contest 334

Minimum Operations to Reduce an Integer to 0 | Weekly Contest 333 | Leetcode

Minimum Operations to Reduce an Integer to 0 | Weekly Contest 333 | Leetcode

Find the String with LCP | Weekly Contest 333 | Leetcode

Find the String with LCP | Weekly Contest 333 | Leetcode

Count the Number of Square-Free Subsets | Weekly Contest 333 | Leetcode

Count the Number of Square-Free Subsets | Weekly Contest 333 | Leetcode

Substring XOR Queries | Weekly Contest 332 | Leetcode

Substring XOR Queries | Weekly Contest 332 | Leetcode

Subsequence With the Minimum Score | Weekly Contest 332 | Leetcode

Subsequence With the Minimum Score | Weekly Contest 332 | Leetcode