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

    Symmetric Tree | Leetcode 101 | Recursive DFS Approach

    3 Mins Read

    The Symmetric Tree problem asks us to check whether a given binary tree is a mirror image of itself around…

    Data Structures & Algorithms

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

    4 Mins Read

    The Binary Tree Right Side View problem asks us to return the list of nodes that are visible when the…

    Data Structures & Algorithms

    Bottom View of Binary Tree | BFS with Horizontal Distance Mapping

    4 Mins Read

    The Bottom View of Binary Tree problem asks us to return the set of nodes visible when looking at the…

    Data Structures & Algorithms

    Top View of Binary Tree | BFS with Horizontal Distance Mapping

    4 Mins Read

    The Top View of Binary Tree problem asks us to return the set of nodes visible when looking at the…

    Data Structures & Algorithms

    Vertical Order Traversal of a Binary Tree | Leetcode 987 | BFS + Sorting Solution

    4 Mins Read

    The Vertical Order Traversal of a Binary Tree problem asks us to traverse a binary tree in a special way:…

    Data Structures & Algorithms

    Count Distinct Substrings – Brute Force and Trie Approaches

    3 Mins Read

    The Count Distinct Substrings problem asks us to calculate the number of unique substrings of a given string. Examples Example…

    Data Structures & Algorithms

    Complete String – Trie Based Solution

    4 Mins Read

    The Complete String problem asks us to find the longest string from a given list such that all its prefixes…

    Data Structures & Algorithms

    Implement Trie ll | Full Trie with Insert, Count, and Erase

    4 Mins Read

    The Implement Trie II problem is an extension of the basic Implement Trie (Prefix Tree). In addition to inserting words…

    Data Structures & Algorithms

    Implement Trie (Prefix Tree) | Leetcode 208 | Efficient String Data Structure

    4 Mins Read

    The Implement Trie (Prefix Tree) problem asks us to design a Trie data structure that supports the following operations: A…

    Data Structures & Algorithms

    Roman to Integer | Leetcode 13 | Mapping and Subtraction Rule Solution

    3 Mins Read

    The Roman to Integer problem asks us to convert a given Roman numeral string into its corresponding integer value. Here’s…

    1 2 3 … 25 Next
    Categories
    • Data Structures & Algorithms (240)
      • Beginner (82)
      • Expert (52)
      • Intermediate (106)
    • Uncategorised (1)
    Recent Posts

    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

    Top View of Binary Tree | BFS with Horizontal Distance Mapping

    2 September 2025

    Vertical Order Traversal of a Binary Tree | Leetcode 987 | BFS + Sorting Solution

    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.