Close Menu
    Code and Debug
    • Home
    • Our Courses
    • Blog
    • About Us
    • Contact Us
    Facebook X (Twitter) Instagram YouTube WhatsApp
    • Home
    • Our Courses
    • Blog
    • About Us
    • Contact Us
    Facebook Instagram YouTube LinkedIn WhatsApp

    Code and Debug – BlogCode and Debug – Blog

    Code and Debug – BlogCode and Debug – Blog
    Data Structures & Algorithms

    Perfect Sum Problem | All 4 DP Solutions in Python

    6 Mins Read

    Given an array arr of non-negative integers and an integer target, the task is to count all subsets of the array whose sum…

    Data Structures & Algorithms

    Minimum sum partition | Solved using Tabulation in Python

    4 Mins Read

    Given an array arr[] containing non-negative integers, the task is to divide it into two sets set1 and set2 such that the absolute difference between their sums is…

    Data Structures & Algorithms

    Partition Equal Subset Sum | Leetcode 416

    3 Mins Read

    This problem is a direct extension of the Subset Sum Problem: instead of checking if any subset sums to a given…

    Data Structures & Algorithms

    Subset Sum Problem | Solved using Dynamic Programming

    6 Mins Read

    Given an array of positive integers arr[] and a value sum, determine if there is a subset of arr[] with sum equal to given sum. Here’s…

    Data Structures & Algorithms

    Cherry Pickup II | Leetcode 1463 | Solved using Dynamic Programming

    9 Mins Read

    You are given a rows x cols matrix grid representing a field of cherries where grid[i][j] represents the number of cherries that you can collect from…

    Data Structures & Algorithms

    Trapping Rain Water | Leetcode 42 | Brute, Better and Optimal Solution using Stack

    6 Mins Read

    Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap…

    Data Structures & Algorithms

    Next Greater Element II | Leetcode 503 | Imaginary List Optimal Solution

    4 Mins Read

    Given a circular integer array nums (i.e., the next element of nums[nums.length – 1] is nums[0]), return the next greater number for every element in nums. Here’s the [Problem…

    Data Structures & Algorithms

    Next Greater Element | Optimal Solution using Stack

    5 Mins Read

    Given an array arr[ ] of integers, the task is to find the next greater element for each element of the array…

    Data Structures & Algorithms

    Infix, Postfix, Prefix Conversions explained in Python

    35 Mins Read

    Postfix, prefix, and infix are three common notations used to write arithmetic expressions. In infix notation, the operator is placed between…

    Data Structures & Algorithms

    Min Stack | Leetcode 155 | Optimal Solution in Python

    5 Mins Read

    If you want to master stack-related challenges and ace your coding interviews, understanding how to implement a Min Stack is crucial. This…

    Previous 1 … 5 6 7 8 9 … 25 Next
    Categories
    • Data Structures & Algorithms (241)
      • Beginner (82)
      • Expert (52)
      • Intermediate (106)
    • Pandas (1)
    • Resume (1)
    Recent Posts

    Pandas Python: The Complete Roadmap for Beginners in 2026

    8 April 2026

    DSA Interview Cheat Sheet: All Patterns You Need to Know

    4 April 2026

    Symmetric Tree | Leetcode 101 | Recursive DFS Approach

    2 September 2025

    Binary Tree Right Side View | Leetcode 199 | BFS and DFS Approaches

    2 September 2025

    Bottom View of Binary Tree | BFS with Horizontal Distance Mapping

    2 September 2025
    Facebook Instagram YouTube LinkedIn WhatsApp
    © 2025 Code and Debug. All rights reserved.

    Type above and press Enter to search. Press Esc to cancel.