3624. Number of Integers With Popcount-Depth Equal to K II | Segment Tree

3621. Number of Integers With Popcount-Depth Equal to K I | Digit DP | Biweekly Contest 161

3594. Minimum Time to Transport All Individuals | LeetCode Weekly Contest 455

3605. Minimum Stability Factor of Array | Biweekly Contest 160

3600. Maximize Spanning Tree Stability with Upgrades | DSU + Binary Search

3590. Kth Smallest Path XOR Sum | Biweekly Contest 159

🎧 FIXED Audio | 3575. Maximum Good Subtree Score | Leetcode Biweekly Contest 158

🎧 FIXED Audio | 3585. Find Weighted Median Node in Tree | LeetCode weekly contest 454

3585. Find Weighted Median Node in Tree | LeetCode weekly contest 454

3575. Maximum Good Subtree Score | Leetcode Biweekly Contest 158

3579. Minimum Steps to Convert String with Operations | LeetCode weekly contest 453

3569. Maximize Count of Distinct Primes After Split | LeetCode weekly contest 452

Codechef Starters 188 (Div 4) | Yet Another Monsters Problem | Editorial Solution

Codechef Starters 188 (Div 4) | Swaps in a String | Editorial Solution

Codechef Starters 188 (Div 3) | K Boxes | Editorial Solution | Heap

3562. Maximum Profit from Trading Stocks with Discounts | LeetCode weekly contest 451

3553. Minimum Weighted Subgraph With the Required Paths II | LeetCode weekly contest 450

Design Amazon S3 | System Design | Amazon interview Question

Design Rate Limiter | Token bucket | Leaky bucket | Sliding window logs

High Level System Design 101: Understanding the Basics

How to create a URL Shortener | Backend + Frontend | CSE Project

3277. Maximum XOR Score Subarray Queries | LeetCode weekly contest 413

Codechef Starters 149 (Div 4) | Chef Loves Beautiful Strings | ZXC | Editorial Solution

Codechef Starters 143 (Div 4) | Max Min And Length | MAXMINLEN | Editorial Solution

Codechef Starters 143 ( Div 4) | Non-Divisor Array | Binary Conversion | A-D

Codeforces Round 958 (Div 2) | The Omnipotent Monster Killer | Split the Multiset | Make Majority

3218 & 3219. Minimum Cost for Cutting Cake i & ii | LeetCode Weekly Contest 406

3213. Construct String with Minimum Cost | Weekly Leetcode 405 | Trie + DP

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

3211. Generate Binary Strings Without Adjacent Zeros | LeetCode 3211 | LeetCode Weekly Contest 405

3201 & 3202. Find the maximum Length of Valid Subsequence i & ii | LeetCode Weekly Contest 404

2192. All Ancestor of a Node in Directed Acyclic Graph | LeetCode 2192 | 2 Approaches

Segment Tree | Queries to find maximum product pair in range with updates #segmenttree

1791. Find Center of Star Graph | 2 Approaches | Leetcode 1791

Segment Tree | Maximum number and it's Frequency | Interview Question | Code + Template

826. Most Profit Assigning Work | INTUITIVE | MEMOIZATION | Linear Time | LeetCode 826

633. Sum of Square Numbers | Two Pointer | LeetCode 633

945. Minimum Increment to make array unique | With Thought process | LeetCode 945

Segment Tree | Min-Max Range Query in an Array | Code + Template | Interview Questions

3181. Maximum Total Rewards using Operation II | Weekly Contest 401 | LeetCode 3181 | Python | C++

3180. Maximum total rewards using Operation | DP + Memoization | LeetCode 3180 | Weekly Contest 401

648. Replace Words | Trie | Interview Question | Uber

LeetCode 846 | Hand of Straight | Intuitive | Hindi

Range Minimum Query | Segment Tree | Interview Questions

Leetcode 3171 | Find Subarray With Bitwise AND Closet to K | LeetCode Contest 400

Segment Tree | LeetCode 307 | Range Sum Query | Update +Query | Interview Questions

Segment Tree | Introduction | LeetCode 307. Range Sum Query | Introduction: Part-1 | Code + Template

LeetCode 3169 | Count Days Without Meeting | LeetCode contest 400 | Hindi

LeetCode 1442 | Count Triplets That Form Two Arrays of Equal XOR | Intuitive | Step-by-Step Solution

LeetCode 260 | Single Number 3 | Intuitive| 3 Approaches| XOR | Hindi

Get Equal Substrings Within Budget | LeetCode 1208 | Sliding Window | Intuitive | Hindi

Special Array With X Elements Greater Than or Equal X | LeetCode 1608 | Binary Search

Leetcode 3158 and 3159 | LeetCode Biweekly Contest 131 | HashMap | Intuitive

Find the Number of Distinct Colors Among the Balls | LeetCode 3160 | LeetCode Biweekly Contest 131

Word Break 2 Explained | Leetcode 140 | Recursion and Memoization

Maximum Score Words Formed by Letters | LeetCode: 1255 | Backtracking | LeetCode Hard

Leetcode: 2925 | Maximum score after applying operation on tree

Subsets | LeetCode 78 | Recursion Tree | BackTracking

Find Number of ways to Reach the K-th Stair | LeetCode 3154 | Weekly contest 398

Special array II | LeetCode: 3152 | Prefix Array | Weekly contest 398