PC97.com - Plus+ Channels for Creators and Shoppers

Greatest Sum Divisible by Three | Multiple Approaches | Detailed | Leetcode 1262 | codestorywithMIK

codestorywithMIKNov 23, 2025

Set Intersection Size At Least Two | Detailed Deep Dive | Leetcode 757 | codestorywithMIK

codestorywithMIKNov 20, 2025

Maximize the Minimum Powered City | Deep Dive | Dry Run | Intuition | Leetcode 2528 | MIK

codestorywithMIKNov 9, 2025

PT30M43S

Power Grid Maintenance | Using DSU | Simplest Explanation | Leetcode 3607 | codestorywithMIK

codestorywithMIKNov 7, 2025

1.7k

PT1H2M46S

Find X-Sum of All K-Long Subarrays II | Detailed Intuition | Complete Dry Run | Leetcode 3321 | MIK

codestorywithMIKNov 5, 2025

9k

PT19M6S

Find X-Sum of All K-Long Subarrays I | Revise DSA Fundamentals | Dry Run | Leetcode 3318 | MIK

codestorywithMIKNov 4, 2025

7k

PT27M34S

The Two Sneaky Numbers of Digitville | Learn Important Bit Concept | Dry Runs | Leetcode 3289 | MIK

codestorywithMIKOct 31, 2025

4.2k

PT19M27S

Smallest Number With All Set Bits | 3 Approaches | Something to learn | Leetcode 3370 | MIK

codestorywithMIKOct 29, 2025

4.1k

PT30M16S

Make Array Elements Equal to Zero | Brute Force | Optimal | Detailed Dry Runs | Leetcode 3354 | MIK

codestorywithMIKOct 28, 2025

5.9k

Maximum Number of Distinct Elements After Operations | Brute Force | Optimal | Leetcode 3397 | MIK

codestorywithMIKOct 21, 2025

Minimum Number of People to Teach | Logical Reasoning | Leetcode 1733 | codestorywithMIK

codestorywithMIKOct 4, 2025

Design Spreadsheet | Simple Simulation | Leetcode 3484 | codestorywithMIK

codestorywithMIKSep 23, 2025

PT25M16S

Design Task Manager | Simple Intuition | Dry Run | Leetcode 3408 | codestorywithMIK

codestorywithMIKSep 18, 2025

6.4k

PT29M31S

Count Submatrices With All Ones | Detailed Explanation | Leetcode 1504 | codestorywithMIK

codestorywithMIKAug 21, 2025

11k

Smallest Subarrays With Maximum Bitwise OR | Detailed Explanation | Leetcode 2411 | codestorywithMIK

codestorywithMIKAug 4, 2025

PT41M10S

Rearranging Fruits | Detailed Explanation | Minute Details | Leetcode 2561 | codestorywithMIK

codestorywithMIKAug 2, 2025

11k

Monotonic Queue | Template | Detailed Dry Runs | Related Problems | codestorywithMIK

codestorywithMIKJul 4, 2025

Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK

codestorywithMIKApr 28, 2025

Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK

codestorywithMIKApr 22, 2025

PT22M24S

Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK

codestorywithMIKApr 16, 2025

10k

PT30M50S

Maximum Absolute Sum of Any Subarray | Kadane's Algorithm | Leetcode 1749 | codestorywithMIK

codestorywithMIKFeb 26, 2025

13k

PT25M31S

Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK

codestorywithMIKFeb 12, 2025

6.8k

PT57M29S

Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK

codestorywithMIKFeb 6, 2025

8.8k

PT17M3S

Check if One String Swap Can Make Strings Equal | 2 Approaches | Leetcode 1790 | codestorywithMIK

codestorywithMIKFeb 5, 2025

4k

Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK

codestorywithMIKDec 28, 2024

Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK

codestorywithMIKDec 15, 2024

Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK

codestorywithMIKNov 25, 2024

PT32M27S

Longest Increasing Subsequence | Recursion & Memo |Tree Diagram |DP Concepts & Qns-11 | Leetcode-300

codestorywithMIKAug 8, 2023

40k

Featured Results

Paths in Matrix Whose Sum Is Divisible by K | Simplest Approaches | Leetcode 2435 | codestorywithMIK

Smallest Integer Divisible by K | Using already Studied Concept | Leetcode 1015 | codestorywithMIK

Greatest Sum Divisible by Three | Multiple Approaches | Detailed | Leetcode 1262 | codestorywithMIK

Set Intersection Size At Least Two | Detailed Deep Dive | Leetcode 757 | codestorywithMIK

Maximize the Minimum Powered City | Deep Dive | Dry Run | Intuition | Leetcode 2528 | MIK

Power Grid Maintenance | Using DSU | Simplest Explanation | Leetcode 3607 | codestorywithMIK

Find X-Sum of All K-Long Subarrays II | Detailed Intuition | Complete Dry Run | Leetcode 3321 | MIK

Find X-Sum of All K-Long Subarrays I | Revise DSA Fundamentals | Dry Run | Leetcode 3318 | MIK

The Two Sneaky Numbers of Digitville | Learn Important Bit Concept | Dry Runs | Leetcode 3289 | MIK

Smallest Number With All Set Bits | 3 Approaches | Something to learn | Leetcode 3370 | MIK

Make Array Elements Equal to Zero | Brute Force | Optimal | Detailed Dry Runs | Leetcode 3354 | MIK

Maximum Number of Distinct Elements After Operations | Brute Force | Optimal | Leetcode 3397 | MIK

Minimum Number of People to Teach | Logical Reasoning | Leetcode 1733 | codestorywithMIK

Design Spreadsheet | Simple Simulation | Leetcode 3484 | codestorywithMIK

Design Task Manager | Simple Intuition | Dry Run | Leetcode 3408 | codestorywithMIK

Count Submatrices With All Ones | Detailed Explanation | Leetcode 1504 | codestorywithMIK

Smallest Subarrays With Maximum Bitwise OR | Detailed Explanation | Leetcode 2411 | codestorywithMIK

Rearranging Fruits | Detailed Explanation | Minute Details | Leetcode 2561 | codestorywithMIK

Monotonic Queue | Template | Detailed Dry Runs | Related Problems | codestorywithMIK

Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK

Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK

Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK

Maximum Absolute Sum of Any Subarray | Kadane's Algorithm | Leetcode 1749 | codestorywithMIK

Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK

Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK

Check if One String Swap Can Make Strings Equal | 2 Approaches | Leetcode 1790 | codestorywithMIK

Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK

Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK

Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK

Longest Increasing Subsequence | Recursion & Memo |Tree Diagram |DP Concepts & Qns-11 | Leetcode-300

Featured Results

Paths in Matrix Whose Sum Is Divisible by K | Simplest Approaches | Leetcode 2435 | codestorywithMIK

Smallest Integer Divisible by K | Using already Studied Concept | Leetcode 1015 | codestorywithMIK

Greatest Sum Divisible by Three | Multiple Approaches | Detailed | Leetcode 1262 | codestorywithMIK

Set Intersection Size At Least Two | Detailed Deep Dive | Leetcode 757 | codestorywithMIK

Maximize the Minimum Powered City | Deep Dive | Dry Run | Intuition | Leetcode 2528 | MIK

Power Grid Maintenance | Using DSU | Simplest Explanation | Leetcode 3607 | codestorywithMIK

Find X-Sum of All K-Long Subarrays II | Detailed Intuition | Complete Dry Run | Leetcode 3321 | MIK

Find X-Sum of All K-Long Subarrays I | Revise DSA Fundamentals | Dry Run | Leetcode 3318 | MIK

The Two Sneaky Numbers of Digitville | Learn Important Bit Concept | Dry Runs | Leetcode 3289 | MIK

Smallest Number With All Set Bits | 3 Approaches | Something to learn | Leetcode 3370 | MIK

Make Array Elements Equal to Zero | Brute Force | Optimal | Detailed Dry Runs | Leetcode 3354 | MIK

Maximum Number of Distinct Elements After Operations | Brute Force | Optimal | Leetcode 3397 | MIK

Minimum Number of People to Teach | Logical Reasoning | Leetcode 1733 | codestorywithMIK

Design Spreadsheet | Simple Simulation | Leetcode 3484 | codestorywithMIK

Design Task Manager | Simple Intuition | Dry Run | Leetcode 3408 | codestorywithMIK

Count Submatrices With All Ones | Detailed Explanation | Leetcode 1504 | codestorywithMIK

Smallest Subarrays With Maximum Bitwise OR | Detailed Explanation | Leetcode 2411 | codestorywithMIK

Rearranging Fruits | Detailed Explanation | Minute Details | Leetcode 2561 | codestorywithMIK

Monotonic Queue | Template | Detailed Dry Runs | Related Problems | codestorywithMIK

Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK

Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK

Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK

Maximum Absolute Sum of Any Subarray | Kadane's Algorithm | Leetcode 1749 | codestorywithMIK

Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK

Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK

Check if One String Swap Can Make Strings Equal | 2 Approaches | Leetcode 1790 | codestorywithMIK

Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK

Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK

Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK

Longest Increasing Subsequence | Recursion & Memo |Tree Diagram |DP Concepts & Qns-11 | Leetcode-300

Loading...